Consider a three-level memory system,where the access time for the cache is T1nanoseconds, main memory access time isT2 microseconds, and disk access time is T3milliseconds. Main memory hit ratio isestimated to be 40%.a) What are the minimum and themaximum possible access times? Showyour work.b) If the cache hit ratio H is 60%. What is therelation between T1, T2, and T3 to achievean average access time less than 10 * T1.Show your work.

Name: Consider a three-level memory system,where the access time for the ca
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a three-level memory system,where the access time for the cache is T1nanoseconds, main memory access time isT2 microseconds, and disk access time is T3milliseconds. Main memory hit ratio isestimated to be 40%.a) What are the minimum and the

Given Information of 3-level Memory System- Cache access time = T1 nanoseconds Main Memory access…

Engineering

Computer Science

Consider a three-level memory system, where the access time for the cache is T1 nanoseconds, main memory access time is T2 microseconds, and disk access time is T3 milliseconds. Main memory hit ratio is estimated to be 40%.

Consider a three-level memory system, where the access time for the cache is T1 nanoseconds, main memory access time is T2 microseconds, and disk access time is T3 milliseconds. Main memory hit ratio is estimated to be 40%.

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

Consider a 32 bit microprocessor that has on chip 32 K byte 4 way set associative cache. Block size of cache is two 32 bit words. The set number (in decimal) to which the word from memory location FAFEEBE1 wrapped.
Consider a virtual memory system with the following characteristics for accessing memory: 1 nanosecond for a read operation with a hit in cache 5 nanoseconds for a read operation with a miss in cache 2 nanoseconds for a write operation with a hit in cache 10 nanoseconds for a write operation with a miss in cache The cache hit ratio is 0.9 If a sequence of instructions were executed: 100 instruction fetch operations, 60 memory operand read operations, and 40 memory operand write operations, what would be the average memory access time (in nanoseconds) in executing the sequence of instructions:
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?
A system with simple paged memory management has addresses of B bits and pages of size P KiB. If all memory is pageable, what is the maximum number of items contained in a process's page table? What if K KiB are reserved for the kernel and are not pageable? Also suppose that the page table is organized in 2 levels, so that the page directory (first level) is addressed by D bits. How many bits will be used to address the second level? How many entries will there be, at most, among all the tables of the pages (first and second level) of a process?
Suppose a processor has access to three levels of memory. Level 1 has an access timeof 9 microseconds, level 2 has an access time of 23 microseconds and level 3 has anaccess time of 65 microseconds. Level 1 contains a subset of the bytes contained inlevel 2, and level 2 contains a subset of the bytes contained in level 3. It is estimatedthat 35 % of all requested bytes are contained in level 1, 68 % of all requested bytesare contained in level 2 and 100 % of all requested bytes are contained in level 3. If abyte to be accessed is in level 1, then the processor will directly access it from level 1.If a byte to be accessed is not in level 1 but in level 2, then the processor will directlyaccess it from level 2. If a byte to be accessed is not in level 1 and not in level 2, thenthe processor will directly access it from level 3. For simplicity, we assume that theaccessed bytes are not transferred between the memory levels. Moreover, we ignorethe time that is required for the processor to…
Assume miss rate of an instruction cache is 2% and miss rate of data cache IS 4%, If a processor have CPI of 2 without any memory stalls and miss penalty is 100 cycles for all misses, determine how much faster a processor would run with a perfect cache that never missed. Assume frequency of all loads and stores is 36%.
Consider a DRAM chip of capacity 256 KB and each memory location contains 8 bits. The memory chip is organized in matrix form with equal number of rows and column for each memory location of 8 bits. This DRAM chip has a refresh interval of 64 ms, memory bus runs at 200 MHz, and the refresh cycle takes 4 clock cycle. a) Time required to refresh the DRAM chip. b) What is the minimum size of the refresh counter?
Calculate the CPU execution time (expressed in milliseconds) of a program with 10 million instructions on a 2.5 GHz CPU with the following basic instruction-type breakdowns and CPIs: Arithmetic: 60%, CPI = 2 Load & Store (assuming perfect caches): 25%, CPI = 5 Branching: 15%, CPI = 3 In addition, you are told that the overall cache miss rate for instructions is 1%, the overall cache miss rate for data is 3%, and the cache miss penalty is 100 cycles. You can ignore the hit time (consider it zero).
A computer has instructions that each require two bus cycles, one to fetch the instruc- tion and one to fetch the data. Each bus cycle takes 10 nsec and each instruction takes 20 nsec (i.e., the internal processing time is negligible). The computer also has a disk with 2048 512-byte sectors per track. Disk rotation time is 5 msec. To what percent of its normal speed is the computer reduced during a DMA transfer if each 32-bit DMA transfer takes one bus cycle?