The memory access time is I nanosccond for a read operation with a hit in cache. nanoseconds for a read operation with a tiss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 anoseconds for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is

The memory access time is I nanosccond for a read operation with a hit in cache. nanoseconds for a read operation with a tiss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 anoseconds for a write operation with a miss in cache. Execution of a sequence of instructions involves 100 instruction fetch operations, 60 memory operand read operations and 40 memory operand write operations. The cache hit-ratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A microprocessor has an increment memory direct instruction, which adds 1 to the value in a memory location. The instruction has five stages: fetch opcode(four bus clock cycles),fetch operand address (three cycles), fetch operand (three cycles) add 1 to operand (three cycles), and store operand (three cycles). a. By what amount (in percent) will the duration of the instruction increase if we have to insert two bus wait states in each memory read and memory write operation? b. repeat assuming that the increment operation takes 13 cycles instead of 3 cycles
Microprocessors
A cache has a hit time Tc = 2 cycles and a miss rate Pmiss = 0.04. The main memory access time is Tmm = 36 cycles. The data-cache and instruction-cache have identical performance. A program has the following instruction distribution: probability of 0.3 for R-type instructions, 0.2 for load, 0.1 for store, and others for control instructions. Assume control instructions do not cause any loss. The processor is running at 1 GHz. Evaluate the average access time in nano-seconds of the memory system.
In this scenario, the CPU is simultaneously making a cache request and returning a block from the write buffer to main memory.
L1 cache is known as Random Access Memory Direct Access Memory Associative Access Memory Sequential Access Memory
A program sees a 4% miss rate on both the Instruction Cache and the Data Cache. Every instruction requires access to the Instruction cache. Only 35% of the instructions require data access from the Data Cache. The miss penalty for either the data or the instruction cache is 100 cycles. Assume the average Clocks per Instruction (CPI) is 2 without any memory stalls (this is a hypothetical machine where if there were no misses on that instruction, it would get executed in 2 clock cycles. We are not worrying about how it is implemented, just, that suppose it was possible). Assume the number of instructions in a program is X. F1: What is the number of 'instruction miss cycles'? (The number of clock cycles lost due to a miss on the Instruction Cache) F2: What is the number of 'data miss cycles'? F3: What is the total run time of the program including the missed cycles dues to data and instruction misses?
How should the CPU react if it is unable to satisfy a cache request while writing a block from the write buffer back into main memory?
A CPU is equipped with a cache. If it takes 4 ns to access the data from the cache and 100 ns to access data from the main memory, what is the effective memory access time if the hit ratio is 90%? Answer = ns
In designing a computer’s cache system, the cache block or cache line size is an important parameter. Which of the following statements is correct in this context? A smaller block size implies better spatial locality A smaller block size implies a smaller cache tag and hence lower cache tag overhead A smaller block size implies a larger cache tag and hence lower cache hit time A smaller bock size incurs a lower cache miss penalty
You are given a main memory of 64Mbytes with each byte addressable and asked to design a cache memory using direct mapping. The main memory is organized as blocks of 8bytes. The cache memory must have a size of 512Kbytes. How many lines do you need to use in the cache memory?
What principles are preferred to bring data into cache, so that low amount of miss ratio is being observed?
Memory Management: Dynamic Memory Partitioning & Paging Algorithm 5. If it is known the base register offset is at 14000, and physicaladdress is at address 14450, then where is the logical address?