
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question

Transcribed Image Text:Assume th at we have a computer with a cache memory of 512 blocks with a total size of
128K bits.
Knowing that the computer uses a word addressable mode and the format of the memory
address as seen by the Fully associative cache scheme is as shown below, an swer the
below question s:
Fully Associative Cache Format
19
1- How many words do we have in each cache block?
2- What is the size of each word?
3- What is the size of the main memory?
4- How many blocks are there in the main memory?
5- Draw the format of the memory address as seen by the Direct Mapped Cache
scheme, showing the fields as well as their sizes.

Transcribed Image Text:2. For a computer th at uses 9-bit word size and Signed Magnitu de (SM) arith metic to
represent numbers, show how this computer will perform the addition of the two
decimal numbers (-129) and (-171). You should:
a. Findthe equivalent SM values of (-129) and (-171).
b. Showhow this computer will perform the addition of the two numbers.
c. Read the resultin SM to its equivalentin decimal and state whether the result is
correct or not.
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
Trending nowThis is a popular solution!
Step by stepSolved in 4 steps

Knowledge Booster
Similar questions
- A two-way set associative cache memory uses blocks of four words. The cache canaccommodate a total of 4096 words from main memory. The main memory size is 256K x 32.a) How many bits are there in tag, index, block, and word fields of the address format.b) How many bits are there in each words of cache, and how are they divided intofunctions?c) How many blocks can the cache accommodate?arrow_forwardCA_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.arrow_forwardNumb 5 a. Note:Sir can you please solve it with correct answare it will be very much helpful.You can solve it in a paperarrow_forward
- Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 16 bytes each. Assuming that each memory address has 16 bits, to which cache block would the hexadecimal address 0x13F map if the computer uses direct mapping? Blocks are numbered starting at 0.arrow_forwardTake into account the following scenario: we have a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. Since there are 8 bytes in a block, you can use that information to calculate how big the offset field has to be.arrow_forward3. Caching In this question, let's assume that we have a 16-bit system with a single level 6-way set associative cache with 8 sets, and a cache block size of 64 bytes. How many bits are needed for the setID and the tags? Draw the breakdown of the tag/index/byte- in-block bits. What is the total size of this cache? For the following program, assume that an integer is 4 bytes. int i; // Assume these variables are stored in the registers. int a[65536]; // Assume that a = 0x1000 int b[65536]; // Assume that b = 0x8000000 for (i=0; i<1024; i++) a[i* 8 ] = i; for (i=0; i<1024; i++) b[i * 8 ] = a[i * 8 ]++; Let's asssume that the array is initialized to zero and that the variable i is already stored on the register. What is my cache hit rate? Show your work.arrow_forward
- Assume a cache of 1 MB organized as 32 bytes each line. The main memory is 256 MB. a. Determine the number of blocks in main memory b. Determine how to split the address (s-r, r, w) for direct mapping. c. Determine how to split the address (s, w) for associative mapping. d. Determine how to split the address (s-d, d, w) for set-associative each cache set is 4 lines of the cache.arrow_forwardSuppose we have a byte-addressable computer with a cache that holds 16 blocks of 4 bytes address has 8 bits, to which cache set would the hexadecimal address OxBE map if the computer mapping? each. Assuming that each memory uses 2-way set associativearrow_forwardConsider a 64K L2 memory and a 4K L1 2-way associative cache with block sizes of 512. a. How many blocks are in each set in L1? b. How many offset bits are in the L2 address? c. How many index bits are in the L2 address? d. How many tag bits are in the L2 address?arrow_forward
- Take into account the following scenario: we have a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 blocks of cache memory. Since there are 8 bytes in a block, you can use that information to calculate how big the offset field has to be.arrow_forwardQuestion 24 Some portion of cache system B represented a 2-way set-associative mapping cache system. The system is byte-addressable and the block size is one word (4 bytes). The tag and set number are represented with a binary numbers. The contents of words in the block are represented with hexadecimal. Tag 10 1000 0100 1001 11 1100 0100 1001 10 1000 0100 1001 11 1100 0100 1101 10 1000 0100 1001 11 1100 0100 1001 10 1000 0100 1001 11 1100 0100 1101 10 1000 0100 1001 11 1100 0100 1001 10 1000 0100 1001 11 1100 0100 1101 Set Number 0110 1101 0110 1101 0110 1110 0110 1110 0110 1111 0110 1111 0111 0000 0111 0000 0111 0001 0111 0001 0111 0010 0111 0010 00 2. What is the size of cache memory? Word within block 01 2016 6116 C116 10 3216 7216 C216 4216 8216 4116 5216 9216 8216 3216 4216 8216 6116 1. What is the size of the main memory for cache system B? 11 2116 D216 2016 6116 D116 3216 7216 C216 D216 A216 B216 5116 5216 A216 5216 2716 6116 C116 7216 C216 A216 8216 4116 A216 5216 9216 5216…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON

Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning

Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY