1. Suppose a computer has 2³2 bytes of byte-addressable main memory and a cache size of 2¹5 bytes, and each cache block contains 64 bytes. a) How many blocks of main memory are there? (_ b) How many blocks of cache memory are there? ( If this cache is direct-mapped, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of block field and the size of the offset field d) If this cache is fully associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ and the size of the offset field e) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of set field and the size of the offset field

1. Suppose a computer has 2³2 bytes of byte-addressable main memory and a cache size of 2¹5 bytes, and each cache block contains 64 bytes. a) How many blocks of main memory are there? (_ b) How many blocks of cache memory are there? ( If this cache is direct-mapped, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of block field and the size of the offset field d) If this cache is fully associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ and the size of the offset field e) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache; that is, the size of the tag field_ the size of set field and the size of the offset field

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

Related questions

Q: A system uses pure segmentation (no paging). A segment table (see below) contains the following…

A: 1) LA(5, 2000) Here offset<size, So physical address = offset + base address = 2000+2000=4000…

Q: Suppose a computer using direct mapped cache has 4M byte of byte-addressable main memory, and a…

A: Computer memory is a device that stores data and allows us to retrieve it when needed. Primary…

Q: Suppose a byte-addressable computer using set associative cache has 2^24 bytes of main memory and a…

A: In a set-associative cache, it can be defined in such a way that the cache is divided into units,…

Q: 5. Suppose a byte-addressable computer using set-associate cache has 2^21 bytes of main memory and a…

A: If the number of address bits are n then, the size of the cache is 2n words. Since, the size of the…

Q: 3. Suppose a computer using direct mapped cache has 2^32 byte of byte-addressable main memory and a…

A: Solution: a) It is given that the size of the main memory= 232 bytes Cache size = 1024 bytes = 210…

Q: If we have to design a 4 - way set - associative cache of 8 MB size that could work for a main…

A: Answer 1> 221 (the number of cache blocks that 8MB cache can accommodate) Answer 2> Size of…

Q: Suppose a byte-addressable computer using 8-way set associative cache has 256MB of main memory and a…

A: Solution ; Main memory = 256MB Main memory in bits = log2(256M) = log2(228) = 28 bits

Q: Give the number of the virtual page that the byte with virtual memory address 52000 belongs to,…

A: Page size = 8KiB This means page offset = log 8KiB = 13 bits So the least significant 13 bits will…

Q: 1. Suppose a computer using direct mapped cache has 2^20 bytes of byte-addressable main memory, and…

A: Given:- Size of main memory = 220 bytes Size of blocks = 24 bytes…

Q: 2. 2. Suppose a computer using direct-mapped cache has 2³2 bytes of byte-addressable main memory and…

A: Given Data Main Memory Size = 232 Bytes Number of Cache Blocks = 1024 = 210 Block Size = 32 Bytes =…

Q: Cache Memory Caches depend on the locality principle – if you access memory locations near to each…

A: Given: Cache Memory Caches depend on the locality principle – if you access memory locations near to…

Q: Paging: Select all of the following statements that are true. Systems that use paging but do not…

A: Answer to the above question is given below

Q: The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the…

A: The correct option is (c) Answer 1 and Answer 2 are given below choose one from them which is easy…

Q: 3. We've seen variable types that store characters, integers and floating point numbers. In a very…

A: A detailed answer is given below:

Q: Suppose a computer using a 4-way set associative cache mapping scheme has a 20-bits memory address…

A: Here in this question we have given 4 way set associative cache mapping Memory size = 20 bit Block…

Q: Consider a computer with byte-addressable main memory of size 8 GB and page size of 1 KB. Assume a…

A: Byte addressable memory upholds getting to information in units that are smaller than the transport.…

Q: Assume that A and are arrays with elements of the arrays as 4-byte integers and registers ($56) and…

A: Calculate the values of A and B after completing the loop. 1A(0) = 100, A(1) = 101, A(2) = 102,…

Q: sume variables have logical addresses with 16-bit page numbers and 16-bit offset using the memory…

A: For any given virtual address, the least significant 16 bit of physical address and virtual address…

Concept explainers

Types of database architectures

A Database Architecture represents the Database Management System’s (DBMS) design (schema). The DBMS architecture makes it easy to understand the components involved in the database system and their relations. The DBMS architecture may vary based on the system on which it runs. Some systems contain both client and server machines whereas some run only on a server machine. Based on the architecture, the system can be classified as centralized, decentralized, or hierarchical.

Question

1. Suppose a computer has 2³2 bytes of byte-addressable main memory and a cache
size of 2¹5 bytes, and each cache block contains 64 bytes.
a) How many blocks of main memory are there? (_
b)
How many blocks of cache memory are there? (_
c)
If this cache is direct-mapped, what is the format of a memory address as seen by the cache;
that is, the size of the tag field_
the size of block
field
and the size of the offset field_
d) If this cache is fully associative, what is the format of a memory address as seen by the cache;
that is, the size of the tag field_
and the size of the offset
field
e) If this cache is 4-way set associative, what is the format of a memory address as seen by the
cache; that is, the size of the tag field_
the size of set
field
and the size of the offset field

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Parts a, b and c

VIEW

Step 2: Parts d and e

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Problem 0. The following table gives some of the parameters for a number of different hardware caches. Fill in the table with the values of the missing parameters. Recall that m is the number of physical address bits, C is the cache size in bytes, B is the block size in bytes, E is the associativity, i.e., lines per set, S is the number of sets, t is the number of tag bits, s is the number of set index bits, and b is the number of block offset bits. Cache m 48 32030 (b) 48 32 24 24 C B E 16384 32 16 32768 64 65536 128 512 32 1024 8 8 4 14 1 4 S b S t
Suppose a byte-addressable computer using set associative cache has 224 bytes of main memory and a cache size of 64K bytes, and each cache block contains 32 bytes. a) If this cache is 2-way set associative, what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, set, and offset fields? b) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
a data structure that stores an ordered list of items, where each item is directly accessible by a positional index a data structure that stores an ordered list of items in nodes, where each node stores data and has a pointer to the next node a data structure in which each node stores data and has up to two children, known as a left child and a right child a data structure that stores unordered items by mapping each item to a location in an array a data structure for representing connections among items, and consists of vertices connected by edges Graph, binary tree, hash table, array, linked list. Assign each term to its definition please
help with part A B AND C.
3.
Suppose a computer using direct mapped cache has 236 bytes of byte-addressable main memory and a cache size of 1024 bytes, and each cache block contains 64 bytes. ⦁ How many blocks of main memory are there? ⦁ What is the format of a memory address as seen by cache, i.e., what are the sizes of the tag, block, and offset fields? ⦁ To which cache block will the memory address 0x13A4576B map?
4. The figure below shows an 8-way interleaved, byte-addressable memory. The total size of the memory is 4 KB. The elements A[i]G) of a 2-dimensional array A are 4-bytes (one-word) in length and can be stored in the memory as shown, where 0 < ij <7. The width of the bus between CPU and memory is 32 bits, that is, it can carry only one word at a time. Bank 1 Bank 7 Bank 0 31 7 A[7][0] A[I][0] A[0]|0] 32 A[7]1] 64 A[7]|2] A[I][2] A[0||2] RANKO 255 224 AI기기 A[I][7] A[0||7) RANKN ...... Since the address space of the memory is 4 KB, 12 bits are needed to uniquely identify each memory location, i.e., Addr[11:0]. Find out and explain which bits of the address will be used for: • Byte on bus: Addr […... :...] Bank index bits within a bank: Addr [.... .] • Chip select address bits within a rank: Addr […... .] • Rank bits: Addr […... :....]
Suppose a byte-addressable computer using set-associative cache has 216 bytes of main memory and a cache of 32 blocks, and each cache block contains 8 bytes.Q.) If this cache is 4-way set associative, what is the format of a memory address as seen by the cache?
CA_6 We study the properties of cache memory, and for reasons of easier design and efficient circuits, we assume that the cache capacity is 2i Bytes, and cache line size is 2j Bytes, with i and j being natural numbers: (a) How many bits should the tag field have? And can the tag field contain 0 bit (i.e., be empty)? Elaborate (b) Repeat the above for the index field. (c) Repeat the above for the byte-offset field. (d) Finally, depict a figure showing a cache line, indicate what fields it possibly has, state the possible sizes of these fields, and explain the uses of these fields.
5. suppose a computer using fully associative cache has 224 bytes of byte-addressable main memory and a cache of 128 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 ; that is, what are the size of the tag and offset field. c) To which cache block will the memory address 0x01D872 map?
.2: Below is a list of 32-bit memory address references, given as word addresses. 3, 180, 43, 2, 191, 88, 253 For each of these references, identify the binary address, the tag, and the index given a direct- mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 2-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty. For each of these references, identify the binary address, the tag, and the index given a direct-mapped cache with 4-word blocks and a total size of 8 blocks. Also list if each reference is a hit or a miss, assuming the cache is initially empty.
1. Suppose an array with six rows and eight columns is stored in a row major order starting at address 20 (base 10). If each entry in the array requires only one memory cell, what is the address on the entry in the third row and fourth columns? What if each entry requires two memory cells?