The memory of a computer is byte-addressable, and the word length is 32 bits. A program consists of two nested loops- a small inner loop and a much larger outer loop. The general structure of the program is given in Figure P8.1. The decimal memory addresses shown delineate the location of the two loops and the beginning and end of the total program. All memory locations in the various sections of the program, 8-52,56-136, 140-240, and so on, contain instructions to be executed in straight-line sequencing. The program is to be run on a computer that has an instruction cache organized in the direct-mapped manner (see Figure 8.16) with the following parameters:

Cache size: 1K bytes

Block size: 128 bytes

The miss penalty in the instruction cache is 80t where t is the access time of the cache. Compute the total time needed for instruction fetcching during execution of the program in Figure P8.1.

Problem 8.5 is the question I need answered.

CHAPTER a Trane MEN o av sysTEA" 292 Block 1 Block 127 Cache Block 128 Block 129 Block 1 Block 255 tag Block 127 Block 256 Block 257 Block 4095 Tag Block Word 4 Main memory address Figure 8.16 Direct mapped coche. CHAPTER a Trane MEN o av sysTEA" 292 Block 1 Block 127 Cache Block 128 Block 129 Block 1 Block 255 tag Block 127 Block 256 Block 257 Block 4095 Tag Block Word 4 Main memory address Figure 8.16 Direct mapped coche