17 Memory(NOT ASSESSED) Flashcards Preview

EE20021 Digital systems design > 17 Memory(NOT ASSESSED) > Flashcards

Flashcards in 17 Memory(NOT ASSESSED) Deck (23)
Loading flashcards...
1
Q

HighRisc microprocessor – Harvard architecture

A
2
Q

The performance of a computer depends on aspects such as:

A
  • Instruction Set Architecture
  • RISC/CISC
  • Clock frequency
  • Memory technology
  • Memory level
3
Q

Memory hierarchy and technology?

A
4
Q

ROM

A

BIOS • non-volatile • fast access • made of transistors

5
Q

SRAM

A

needs power to retain the data • typically made of CMOS transistors • accessed very quickly • volatile

6
Q

DRAM (DDR2, DDR3, DDR4)

A

made of capacitor • needs periodic capacitor charge • slow access compared to SRAM • volatile

7
Q

Non-volatile

A

magnetic, optical disks (slow access) • flash memory, fast access • reprogrammed multiple times

8
Q

Location of ROM,SRAM DRAM NonVolitile

A
9
Q

Memory sizes for different types?

A
10
Q

Retrieving data with the memory hierarchy

A
11
Q

Memory system performance metrics

A

hit: the requested data resides in a given level of memory
miss: the requested data is not located in a given level of memory

hit rate: the percentage of memory accesses found in a given level of memory

hit miss: the percentage of memory accesses not found in a given level of memory

12
Q

Equation for miss rate and hit rate?

A
13
Q

We want to know the performance of the cache memory. The CPU has accessed memory 10,000 times searching for data. A total of 1500 times the requested data was found in the main memory, and 8500 times the data was found in the cache. What are the hit and miss rates?

A
14
Q

The principle of loacality?

A

Processors tend to access memory in a very patterned way. For example, in a program running, when the PC fetches instruction at memory address X, there is a high probability that the data from memory location X+1 will be needed soon.

15
Q

There are two forms of locality

A
  • Temporal locality: recently accessed items will tend to accessed again soon.
  • Spatial locality: if an item is accessed, then items in nearby memory locations will tend to be accessed soon
16
Q

Why do we use the principle of locality?

A

This principle allows a computer to use small and fast memory that effectively handles information, to achive low miss rate.

17
Q

Cache Memory?

A

A cache memory holds commonly used data.

If the processor needs data, first the cache memory is checked, if the cache hits, then the data is available immediately. Otherwise, the processor check the main memory and places the data in the cache for future use.

18
Q

Tasks of the Cache memory?

A
19
Q

How is the Cache mapped?

A
  • The cache memory is organised in sets (s), block (b) and ways (w).
  • In direct mapped cache, an address in the main memory is mapped to a unique location (block and set) in the cache.
  • In direct mapped cache, each set contains one block only
20
Q

Cache diagram?

A
21
Q

Direct mapped cache positioning?

A
22
Q

If the processor needs some data then:

A

Checks the set bits from the address, e.g., 011

  1. Checks if the tag in cache matches address tag
  2. Checks if valid bit is 1
  3. If everything matches, then the cache hits and the data is sent to the processor

Otherwise,

  1. the cache misses
  2. The data is fetched from the main memory
23
Q
A