Question: A computer system contains a main memory of 32KB. It also has a 1KB cache divided into two-lines/set with 8Bytes per line. Assume that the cache is initially empty. The processor fetches words from locations 1024, 1025, 1026..1072. and then 2048, 2049, 2050, ..... .. 2096 in that order. It then repeats this fetch sequence two more times. Calculate the Hit ratio and show the state of cache at the end. Assume an LRU is used as replacement algorithm. Estimate the improvement resulting from the use of the cache, if the cache is 20 times faster than RAM. Just comment on relative Hit ratios and Execution times if Fully Associative and Direct Mapping are used here.

Question: A computer system contains a main memory of 32KB. It also has a 1KB cache divided into two-lines/set with 8Bytes per line. Assume that the cache is initially empty. The processor fetches words from locations 1024, 1025, 1026..1072. and then 2048, 2049, 2050, ..... .. 2096 in that order. It then repeats this fetch sequence two more times. Calculate the Hit ratio and show the state of cache at the end. Assume an LRU is used as replacement algorithm. Estimate the improvement resulting from the use of the cache, if the cache is 20 times faster than RAM. Just comment on relative Hit ratios and Execution times if Fully Associative and Direct Mapping are used here.

Name: Question: A computer system contains amain memory of 32KB. It also ha
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Question: A computer system contains amain memory of 32KB. It also has a 1KBcache divided into two-lines/set with8Bytes per line. Assume that thecache is initially empty. The processorfetches words from locations 1024, 1025,1026..1072. and then 2048

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

Suppose we have a byte-addressable computer using direct mapping with 16-bit main memory addresses and 32 blocks of cache. If each block contains 8 bytes. a. Determine the number of bits of the tag field. b. To which cache block would the hexadecimal address 0x2468 map? c. What is the tag of the hexadecimal address 0x2468
Unlike a byte that is always 8 bits, word size can vary from machine to machine. Let's say we have a 16-bit system (word size is 2 bytes) and a memory unit that has 10 address lines. Because there are 10 address bits, we can have 210 unique addresses, hence 1024 addresses. If we are working with something word-addressable, that means each word has a unique address, and we canstore 1024 words. The memory size is 1 kiloword, or equivalently, 2kilobytes because each word is 2 bytes long. The address of the first word is 0, the second word is 1, the third word is 2, and the last word is 1023.Now, with 4 address lines and a word size of 4 bits, what is the address of the last word?
Consider a memory-management system based on paging. The total size of the physical address space 64 MB, Pages of size 4 KB, the Logical address space of 4GB. total number of pages are 16384, total number of frames are 16384 and the number of entries in a page table are 1048576.Now Calculate: a)Size of Page Table b) No of bits in Physical Address c) No of Bits in Logical Address
Suppose a computer using fully associative cache has 4G bytes of byte-addressable main memory and a cache of 512 blocks, where each cache block contains 128 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? c) To which cache block will the memory address 0x018072 map?
A computer of 32 bits has a cache memory of 64 KB with a cache line size of 64 bytes. The cache access time is 20 ns, and the miss penalty is 120 ns. The cache is 2-way associative. a) What is the number of cache lines? b) What is the number of cache sets? c) What is the number of lines per set? d) Draw a scheme of this cache. e) Calculate the time to read a word in case of miss.
Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.{a} How much RAM can the machine support (each byte of RAM must be addressable)?{b} What is the largest virtual address space that can be supported for a process?{c} If pages are 2 KB, how many entries must be in a single-level page table?{d} If pages are 2 KB and we have a two-level page table where the first level is indexed by 15-bits, then how many entries does the first-level page table have?{e} With the same setup as part {d}, how many entries are in each second-level page table?{f} What is the advantage of using a two-level page table over single-level page table?
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…
Suppose a computer using direct mapped cache has 4M byte of byte-addressable main memory, and a cache of 512 blocks, where each cache block contains 64 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag, block, and offset fields? c) To which cache block will the memory address 0x00007266 map?