HW6-Grading Policy

HW6-Grading Policy - 7.3 The key features of solutions to...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
The key features of solutions to these problems: Low temporal locality for data means accessing variables only once. High temporal locality for data means accessing variables over and over again. Low spatial locality for data means no marching through arrays; data is scattered. High spatial locality for data implies marching through arrays. 7.9 2–miss, 3–miss, 11–miss, 16–miss, 21–miss, 13–miss, 64–miss, 48–miss, 19–miss, 11–hit, 3–miss, 22–miss, 4–miss, 27–miss, 6–miss, 11–mis. Cache set Address 0000 48 0001 0010 2 0011 3 0100 4 0101 21 0110 6 0111 1000 1001 1010 1011 11 1100 1101 13 1110 1111 7.10 2–miss, 3–hit, 11–miss, 16–miss, 21–miss, 13–miss, 64–miss, 48–miss, 19–miss, 11–hit, 3–miss, 22–hit, 4–miss, 27–miss, 6–hit, 11–miss 7.12 The Intrinsity caches are 16 KB caches with 256 blocks and 16 words per block. Data is 64 bytes = 512 bytes. The tag field is 18 bits (32 – (8 + 6)). Total bits = 256
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

HW6-Grading Policy - 7.3 The key features of solutions to...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online