Notice that references to do not have good temporal

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: twice as big? Practice Problem 6.17: Given the assumptions of Problem 6.15, determine the cache performance of the following code: 1 2 3 4 5 6 for (i = 0; i < for (j = 0; total_x total_y } } 16; i++){ j < 16; j++) { += grid[i][j].x; += grid[i][j].y; A. What is the total number of reads? _______. B. What is the total number of reads that miss in the cache? _______ . C. What is the miss rate? _______. D. What would the miss rate be if the cache were twice as big? 6.6. PUTTING IT TOGETHER: THE IMPACT OF CACHES ON PROGRAM PERFORMANCE 327 6.6 Putting it Together: The Impact of Caches on Program Performance This section wraps up our discussion of the memory hierarchy by studying the impact that caches have on the performance of programs running on real machines. 6.6.1 The Memory Mountain The rate that a program reads data from the memory system is called the read throughput, or sometimes the read bandwidth. If a program reads Ò bytes over a period of × seconds, then the read throughput over that period is Ò ×, typically expressed in units of MBytes...
View Full Document

Ask a homework question - tutors are online