19
William Stallings Computer Organization and Architecture Memory

William Stallings Computer Organization and Architecture Memory

Embed Size (px)

Citation preview

Page 1: William Stallings Computer Organization and Architecture Memory

William Stallings Computer Organization and Architecture

Memory

Page 2: William Stallings Computer Organization and Architecture Memory

Terminologi

Memory cell Memory Word Byte Address Volatile Memory Write and Read Operation

Page 3: William Stallings Computer Organization and Architecture Memory

Memori Cell Operation

Page 4: William Stallings Computer Organization and Architecture Memory

Diagram Memori

Page 5: William Stallings Computer Organization and Architecture Memory

Characteristics

Location Capacity Unit of transfer Access method Performance Physical type Physical characteristics

Page 6: William Stallings Computer Organization and Architecture Memory

Location

CPU Internal External

Page 7: William Stallings Computer Organization and Architecture Memory

Capacity

Internal memory : a byte a word in 8, 16, 32 bit

External memory a byte

Page 8: William Stallings Computer Organization and Architecture Memory

Unit of Transfer

Internal in a word or larger, such as 16, 128,

256 External

Usually a block which is much larger than a word

Page 9: William Stallings Computer Organization and Architecture Memory

Access Methods (1)

Sequential Memory is organized into unit of data : record. Access must be made in a specific linear

sequence Store addressing information is used to separate

record and assist in the retrieval process. Access time depends on location of data e.g. tape

Page 10: William Stallings Computer Organization and Architecture Memory

Access Methods (2)

Direct Memory is organized into blocks Individual blocks have unique address Access is by jumping to vicinity plus

sequential search Access time depends on location e.g. disk

Page 11: William Stallings Computer Organization and Architecture Memory

Access methode (3) Random

Individual addresses identify locations exactly Access time is independent of location e.g. RAM

Associative (4) Data is located by a comparison with contents of a

portion of the store A word is retrieved based on a portion of its content

rather than its address Access time is independent of location e.g. cache

Page 12: William Stallings Computer Organization and Architecture Memory

Performance

Access time Time between presenting the address

and getting the valid data Memory Cycle time

Time may be required for the memory to “recover” before next access

Cycle time is access + recovery Transfer Rate

Rate at which data can be moved

Page 13: William Stallings Computer Organization and Architecture Memory

Physical Types

Semiconductor RAM ROM

Magnetic Disk & Tape

Optical CD & DVD

Others Bubble Hologram

Page 14: William Stallings Computer Organization and Architecture Memory

Physical Characteristics

Volatility Erasable Power consumption

Page 15: William Stallings Computer Organization and Architecture Memory

The Bottom Line

How much? Capacity

How fast? Time is money

How expensive?

Page 16: William Stallings Computer Organization and Architecture Memory

So you want fast?

It is possible to build a computer which uses only static RAM (see later)

This would be very fast This would need no cache

How can you cache cache? This would cost a very large

amount

Page 17: William Stallings Computer Organization and Architecture Memory

Memory Hierarchy

Registers In CPU

Internal or Main memory RAM

External memory Backing store

Page 18: William Stallings Computer Organization and Architecture Memory

Hierarchy List

Registers L1 Cache L2 Cache Main memory Disk Optical Tape

Page 19: William Stallings Computer Organization and Architecture Memory

Memory Hierarchy - Diagram