CH04&5-COA10e

0.0(0)
Studied by 11 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/56

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:34 AM on 9/30/24
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

57 Terms

1
New cards

Principle of Locality

during the course of execution of a program, memory references by the processor tend to cluster.

2
New cards

Principle of Locality

It is also called the locality of reference

3
New cards

Location

Refers to whether memory is internal and external to the computer

4
New cards

Internal Memory

_____________ is often equated with main memory

5
New cards

registers

Processor requires its own local memory, in the form of ___________

6
New cards

Cache

______ is another form of internal memory

7
New cards

bytes

Memory is typically expressed in terms of ______

8
New cards

unit of transfer

For internal memory the ____________ is equal to the number of electrical lines into and out of the memory module

9
New cards

Location
Capacity
Unit of Transfer

3 Characteristics of Memory Systems

10
New cards

Sequential Access

Access must be made in a specific linear sequence

11
New cards

Direct Access

Individual blocks or records have a unique address based on physical location

12
New cards

Random Access

Any location can be selected at random and directly addressed and accessed

13
New cards

Associative Access

Each location has its own addressing mechanism and retrieval time is constant independent of location or prior access patterns

14
New cards

Sequential
Direct
Random
Associative

4 Methods of Accessing Units of Data

15
New cards

Capacity & Performance

Two most important characteristics of memory

16
New cards

Access time (latency)

•For random-access memory it is the time it takes to perform a read or write operation

•For non-random-access memory it is the time it takes to position the read-write mechanism at the desired location

17
New cards

Memory cycle time

Access time plus any additional time required before second access can commence

18
New cards

Memory cycle time

Additional time may be required for transients to die out on signal lines or to regenerate data if they are read destructively

19
New cards

Memory Cycle Time

Concerned with the system bus, not the processor

20
New cards

Transfer Rate

The rate at which data can be transferred into or out of a memory unit

21
New cards

Semiconductor memory

Magnetic surface memory

Optical

Magneto-optical

Most common forms of memory

22
New cards

Volatile Memory

Information decays naturally or is lost when electrical power is switched off

23
New cards

Nonvolatile memory

Once recorded, information remains without deterioration until deliberately changed

24
New cards

Nonvolatile memory

No electrical power is needed to retain information

25
New cards

Magnetic-surface memories

Are nonvolatile

26
New cards

Semiconductor memory

May be either volatile or nonvolatile

27
New cards

Nonerasable memory

Cannot be altered, except by destroying the storage unit

28
New cards

Nonerasable memory

Semiconductor memory of this type is known as read-only memory (ROM)

29
New cards

Faster ; greater

____ access time, _____ cost per bit

30
New cards

Greater ; smaller

____ capacity, _____ cost per bit

31
New cards

Greater; slower

_______ capacity, ______ access time

32
New cards

secondary memory or auxiliary memory

External, nonvolatile memory is also referred to as ______________ or __________________

33
New cards

Disk cache

A portion of main memory can be used as a buffer to hold data temporarily that is to be read out to disk

34
New cards

Virtual Memory

Facility that allows programs to address memory from a logical point of view, without regard to the amount of main memory physically available

35
New cards

Direct
Associative
Set Associative

Three techniques used in mapping main memory blocks to cache lines

36
New cards

Direct

Maps each block of main memory into only one possible cache line

37
New cards

Associative

Permits each main memory block to be loaded into any line of the cache

38
New cards

Associative

The cache control logic interprets a memory address simply as a Tag and a Word field

39
New cards

Associative

To determine whether a block is in the cache, the cache control logic must simultaneously examine every line’s Tag for a match

40
New cards

Set Associative

A compromise that exhibits the strengths of both the direct and associative approaches while reducing their disadvantages

41
New cards

Victim Cache

Originally proposed as an approach to reduce the conflict misses of direct mapped caches without affecting its fast access time

42
New cards

Least recently used (LRU)

First-in-first-out (FIFO)

Least frequently used (LFU)

most common replacements algorithms

43
New cards

LRU

Replace that block in the set that has been in the cache longest with no reference to it

44
New cards

FIFO

Replace that block in the set that has been in the cache longest

45
New cards

LFU

Replace that block in the set that has experienced the fewest references

46
New cards

Write through

All write operations are made to main memory as well as to the cache

47
New cards

Write through

The main disadvantage of this technique is that it generates substantial memory traffic and may create a bottleneck

48
New cards

Write back

Minimizes memory writes

49
New cards

Write back

Updates are made only in the cache

50
New cards

Write back

Portions of main memory are invalid and hence accesses by I/O modules can be allowed only through the cache

51
New cards

Write back

This makes for complex circuitry and a potential bottleneck

52
New cards

Multilevel Caches

As logic density has increased it has become possible to have a cache on the same chip as the processor

53
New cards

level 1 (L1)

Internal cache designated as ______

54
New cards

level 2 (L2)

External cache designated as ______

55
New cards
  • Higher hit rate

  • Balances load of instruction and data fetches automatically

  • Only one cache needs to be designed and implemented

What are the advantages of unified cache?

56
New cards
  • Eliminates cache contention between instruction fetch/decode unit and execution unit

  • Important in pipelining

What are the advantages of split cache?

57
New cards
  • One dedicated to instructions

  • One dedicated to data

  • Both exist at the same level, usually as two L1 caches

How are split caches commonly allocated?