X If a program requires 270,000.000 clock cycles to execute on a processor running on a clock of 0.25GHz. its' throughput will be: 1.8 1.08 0.926 0.0675 6.75 X Main memory is 32 times in size of the cache on a system following fully- 0/1 associative mapping. Cache has 32k lines of 4 bytes each. How many tag bits are stored with each cache line? 24 22 X 20 18 16 O 0/1 X

X If a program requires 270,000.000 clock cycles to execute on a processor running on a clock of 0.25GHz. its' throughput will be: 1.8 1.08 0.926 0.0675 6.75 X Main memory is 32 times in size of the cache on a system following fully- 0/1 associative mapping. Cache has 32k lines of 4 bytes each. How many tag bits are stored with each cache line? 24 22 X 20 18 16 O 0/1 X

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 an 32-bit Direct Mapped cache with 8-word block and a total cache size of 1024 words, word addressable where the word size is 32-bits. What is the size in bits of the tag in the cache?
A 512-kB, 4-way set associative cache has 64-byte lines. The system has 64-bit addresses, with bits numbered from 0 (least significant) to 63 (most significant). What bit ranges are associated with each of the offset, index, and tag fields of an address? Tag most significant bit: Tag least significant bit: Index MSP: Index LSB: Offset MSB: Offset LSB:
Design 128KW, fully associative cache that has 4 32-bit words per block. Assume a 32 bit address. Calculate the following: (i) How many bits are used for the byte offset? (i) How many bits are used for the block offset? (k) How many bits are used for the index field? (1) How many bits are used for the tag?
A cache has been designed such that it has 512 lines, with each line or block containing 8 words. Identify the line number, tag, and word position for the 20- bit address 3A45616 using the direct mapping method.
You have a K-Way set associative cache with following parameters Cache Data Size (C) Block Size (b) Blocks/Ways per set (K) After partitioning the address, which is 32 bits big, into Tag, Set, and Offset, how many bits will be in each field? Tag Bits per field [Select] Set ✓ [Select ] 1 W N 3 40960 8 5 4 Offset [Select]
A cache is organized as a 4 way set associative cache Each set's cache line consists of 4 words (meaning there are 16 bytes per line, for each set of the cache). Each set individually has one Valid bit, and one Dirty bit, for each line. The tag field of this cache is 8 bits wide. The address is 32 bits wide. Question 1a) What is the number of cache lines? Question 1b) What is the total number of 'memory bitcells' that are needed to design this cache (note, this includes the bitcells required for the tags, valid and dirty bits).
Computer science question
The hit rate of the memory closest to the ALU is increased from 75% to 80% in a practical cache memory hierarchy. The hit latency (or hit time) for the closest memory is 20ps, while the miss latency is 20ns. What would the expected reduction in the average memory access latency be?