A direct-mapped cache consists of 8 blocks. A byte-addressable main memory contains 4K blocks of eight bytes each. Access time for the cache is 20 ns and the time required to fill a cache slot from main memory is 300 ns. Assume a request is always started in sequential to cache and then to main memory. If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.     c) Compute the effective access time for this program.   Show me how to solve using this equation:  EAT = H x AccessC + (1 – H) x  AccessMM where H is the cache hit rate and AccessC and AccessMM are the access times for cache and main memory, respectively.   thanks

A direct-mapped cache consists of 8 blocks. A byte-addressable main memory contains 4K blocks of eight bytes each. Access time for the cache is 20 ns and the time required to fill a cache slot from main memory is 300 ns. Assume a request is always started in sequential to cache and then to main memory. If a block is missing from cache, the entire block is brought into the cache and the access is restarted. Initially, the cache is empty.  

c) Compute the effective access time for this program.

Show me how to solve using this equation: 
EAT = H x Access_C + (1 – H) x  Access_MM

_{where H is the cache hit rate and AccessC and AccessMM are the access times for cache and main memory, respectively.}

_thanks