Cache Memory course

A computer has different types of memory that are distinguished by their access speeds. The faster the memory is, the more expensive it is and the less the amount available on the computer. The internal or floating internal registers of the microprocessor constitute the memory to which it accesses the fastest but they are in very limited number. Then there is the RAM, the hard drives and then the tapes, which are very slow but which allow to store very large amounts of data.

The caches are intermediate between the internal registers of the microprocessor and the RAM. They are made of fast memory but they are reduced in size compared to the main memory.

When it comes to speed of access to memory, we must distinguish between latency and throughput. Latency is the time that elapses between the request for data and the arrival of the first data. The flow rate then measures the flow of data transmitted during the steady state, that is to say after the latency has elapsed. For a hard disk, the latency is relatively long because the read head must be positioned mechanically and then wait until the right sector is under the head.

For some time now, there has been a gap between the speed of microprocessors and the speed of dynamic memories that are used as main memory of computers. SDRAMs increase throughput but minimize latency. To prevent the microprocessor from losing time to wait for the data in the memory, memory caches formed from faster static memories are interposed between the microprocessor and the main memory. The purpose is similar to that of disk caches to speed up access to hard disks.

Table of contents

  • Memory Hierarchy
  • Principles of locality
  • Cache memory
  • Direct access
  • Partially associative
  • Completely associative
  • Considerations with respect to memory entries
  • Instruction cache and unified cache
  • Common definitions
  • Cache Organization
  • Side note: byte address, block address
  • Design code suitable for cache
  • Rearrange the loops to improve the spatial locality
  • Use blocking to improve temporal locality
Size : 125.88 Kb
File type : pdf
Downloads: 636
Created: 2016-12-31

Warning: Trying to access array offset on false in /home/tutovnfz/public_html/article.php on line 233

Others Memory Tutorials

DRAM: Architectures, Interfaces, and Systems

ROM, EPROM, and EEPROM pdf tutorial

Programming Persistent Memory

Introduction to ARM Memory and Assembly Language

Guide RAM and ROM Based Digital Design

Others related eBooks about Cache Memory course

Program Arcade Games

Download free course Program Arcade Games, pdf file on 392 pages by Paul Craven....

Computer Architecture

In this tutorial, we briefly describe a basic computer architecture and principles of its operation ,a free PDF training course under 12 pages by Milo Martin & Amir Roth....

How To Build Your Own PC

We'll walk you through everything you need to know to build your own PC. This is a free Building PC PDF tutorial in 19 chapters and 26 pages....

Basic Computer Hardware Tutorial

Download Basic Computer Hardware Tutorial, training document in pdf intended to beginners....

Help! My Computer is Broken

Download free course Help! My Computer is Broken, pdf file on 144 pages by Barry Collins....

Analysis for Computer Scientists

Download free course Analysis for Computer Scientists, pdf file on 372 pages by by Michael Oberguggenberger, Alexander Ostermann....

Entity Framework Core Succinctly

Download free course Entity Framework Core Succinctly, pdf file on 111 pages by Ricardo Peres....

Spring Framework Notes for Professionals

Download free course Spring Framework Notes for Professionals, pdf file on 67 pages by Stack Overflow Community....

Fundamentals of computer architecture

Download tutorial in PDF about the fundamentals of computer architecture ,it's a free training document under 290 pages for experienced users by Mostafa Abd-El-Barr and Hesham El-Rewini....

Intelligent Human Computer Interaction

Download free course Intelligent Human Computer Interaction, pdf file on 227 pages by Patrick Horain, Catherine Achard, Malik Mallem....