Essentials of Computer Organization and Architecture
Essentials of Computer Organization and Architecture
5th Edition
ISBN: 9781284123036
Author: Linda Null
Publisher: Jones & Bartlett Learning
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 6, Problem 13E

a)

Explanation of Solution

In direct mapped cache the address of the main memory is being subdivided into 3 parts and they are:

  • Tag
  • Block
  • Word.

Given:

Byte addressable memory= 4K×8 bytes is required.

log2(4K×8)=215 ; 15 will be the total size of the address.

Number of blocks present in the cache is 8 and it is equivalent to 23blocks.

It requires 3 bits for a block field

b)

Explanation of Solution

Calculating the hit ratio:

  • The first address is 0=(000000000000000)2and is considered to be a miss.
  • Thus the blocks containing in this address is moved to the cache.
  • The block that is moved to the cache is from 010 to 710.
  • According to the bit size of the block field (000)2 is equivalent to 0 and it is being moved to the block 0.
  • All the bytes are now moved to the block 0.
  • The above mentioned process of actions will be continued repeatedly until the address 6310
  • The process will be continued in such a way for every miss there would be 7 hits because the starting block is considered to be as miss.
  • After continuing this process, the cache will be found to be full at this stage.
  • Therefore, there will be 8 misses and 56 hits.
  • At the address is 6410=(000000001000000)2and is considered to be a miss.
  • Thus the blocks containing 8 bytes are moved to the main memory.
  • The block 010 to 710 that resides in the main memory is now being replaced to be 6410 to 6710
  • Therefore, there will be 1 miss and 3 hits.
  • At the end of first loop there will be 9 miss and 59 hits.
  • The above mentioned process will be repeated again and again for the remaining loops.
  • The block that resides in the memory will be again gets replaced.
  • Thus 7 hits will be followed for the bytes that remain in the block.
  • For the remaining bytes till 6310 it will be all hit.
  • There will be 1miss followed by 63 hits which are followed by 1 miss and 3 hits.
  • Therefore, in total there will be 2 misses and 66 hits in the second iteration.
  • The process will be repeated for the next third and fourth loop...

c)

Explanation of Solution

Effective Access time (EAT):

  • EAT is a measure of Hierarchal memory performance.
  • A weighted average that utilizes the hit ratio and the relative access time of the levels present in successful order of the memory hierarchy is called as effective access time.

Formula for the effective access time:

The formula for effective access time where the memory contains two levels that includes a main memory and the cache memory is obtained as shown below:

EAT=H×Accessc+(1-H)×AccessMM

In the above formula,

H=cachehitAccessc=cacheaccesstime

Blurred answer
Students have asked these similar questions
D. S. Malik, Data Structures Using C++, 2nd Edition, 2010
Methods (Ch6) - Review 1. (The MyRoot method) Below is a manual implementation of the Math.sqrt() method in Java. There are two methods, method #1 which calculates the square root for positive integers, and method #2, which calculates the square root of positive doubles (also works for integers). public class SquareRoot { public static void main(String[] args) { } // implement a loop of your choice here // Method that calculates the square root of integer variables public static double myRoot(int number) { double root; root=number/2; double root old; do { root old root; root (root_old+number/root_old)/2; } while (Math.abs(root_old-root)>1.8E-6); return root; } // Method that calculates the square root of double variables public static double myRoot(double number) { double root; root number/2; double root_old; do { root old root; root (root_old+number/root_old)/2; while (Math.abs (root_old-root)>1.0E-6); return root; } } Program-it-Yourself: In the main method, create a program that…
I would like to know the main features about the following 3 key concepts:1. Backup Domain Controller (BDC)2. Access Control List (ACL)3. Dynamic Memory
Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education