Consider a direct mapped cache of size 16 KB with block size of 256 bytes. The size of main memory is 128 KB

Numerical problem on Direct mapping

Q. Consider a direct mapped cache of size 16 KB with block size of 256 bytes. The size of main memory is 128 KB.

1. Find number of bits in tag

2. Find tag directory size

Ans. Cache of size = 16 KB = 214 bytes => Its having 14 bits

Block size = 256 bytes = 28 bytes => Its having 8 bits

Main memory size = 128 KB = 217 bytes => Its having 17 bits


Number of bits in Line number  = Cache size / Block size

                                    = 214 bytes / 28 bytes

                                    = 26 

Line number having 6 bits.

Number of bits in Tag = 

Number of bits in main memory - number of bits in line number - number of bits in block

= 17 – Line bits – Block bits

= 17 – 6 – 8 =3


Tag directory size

Size of line number X Number of bits in tag

=26 X 3 bits

= 192 bits

= 192 / 8 bytes

= 24 bytes


More topics from Computer Organization to read

Computer Organization and Architecture:

EasyExamNotes.com covered following topics in these notes.

  1. Structure of desktop computers
  2. Logic gates
  3. Register organization
  4. Bus structure
  5. Addressing modes
  6. Register transfer language
  7. Direct mapping numericals
  8. Register in Assembly Language Programming
  9. Arrays in Assembly Language Programming

References:

  1. William stalling ,“Computer Architecture and Organization” PHI
  2. Morris Mano , “Computer System Organization ”PHI

Post a Comment

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.