dr mohamed menacer college of computer science and engineering, taibah university [email protected],...
TRANSCRIPT
![Page 1: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/1.jpg)
Dr Mohamed MenacerCollege of Computer Science and Engineering, Taibah University
[email protected], www.mmenacer.info.
CS-334: Computer Architecture
Chapter 4: Cache, Internal, External Memory
William Stallings, Computer Organization and Architecture, 7th Edition
![Page 2: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/2.jpg)
Characteristics
• Location• Capacity• Unit of transfer• Access method• Performance• Physical type• Physical characteristics• Organisation
![Page 3: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/3.jpg)
Location
• CPU• Internal• External
![Page 4: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/4.jpg)
Capacity
• Word size—The natural unit of organisation
• Number of words—or Bytes
![Page 5: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/5.jpg)
Unit of Transfer
• Internal—Usually governed by data bus width
• External—Usually a block which is much larger than a
word• Addressable unit
—Smallest location which can be uniquely addressed
—Word internally—Cluster on M$ disks
![Page 6: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/6.jpg)
Access Methods (1)
• Sequential—Start at the beginning and read through in
order—Access time depends on location of data and
previous location—e.g. tape
• Direct—Individual blocks have unique address—Access is by jumping to vicinity plus sequential
search—Access time depends on location and previous
location—e.g. disk
![Page 7: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/7.jpg)
Access Methods (2)
• Random—Individual addresses identify locations exactly—Access time is independent of location or
previous access—e.g. RAM
• Associative—Data is located by a comparison with contents
of a portion of the store—Access time is independent of location or
previous access—e.g. cache
![Page 8: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/8.jpg)
Memory Hierarchy
• Registers—In CPU
• Internal or Main memory—May include one or more levels of cache—“RAM”
• External memory—Backing store
![Page 9: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/9.jpg)
Memory Hierarchy - Diagram
![Page 10: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/10.jpg)
Hierarchy List
• Registers• L1 Cache• L2 Cache• Main memory• Disk cache• Disk• Optical• Tape
![Page 11: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/11.jpg)
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 12: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/12.jpg)
Physical Types
• Semiconductor—RAM
• Magnetic—Disk & Tape
• Optical—CD & DVD
• Others—Bubble—Hologram
![Page 13: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/13.jpg)
Cache
• Small amount of fast memory• Sits between normal main memory and
CPU• May be located on CPU chip or module
![Page 14: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/14.jpg)
Cache/Main Memory Structure
![Page 15: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/15.jpg)
Cache operation – overview
• CPU requests contents of memory location• Check cache for this data• If present, get from cache (fast)• If not present, read required block from
main memory to cache• Then deliver from cache to CPU• Cache includes tags to identify which
block of main memory is in each cache slot
![Page 16: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/16.jpg)
Cache Read Operation - Flowchart
![Page 17: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/17.jpg)
Cache Design
• Size• Mapping Function• Replacement Algorithm• Write Policy• Block Size• Number of Caches
![Page 18: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/18.jpg)
Size does matter
• Cost—More cache is expensive
• Speed—More cache is faster (up to a point)—Checking cache for data takes time
![Page 19: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/19.jpg)
Typical Cache Organization
![Page 20: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/20.jpg)
Comparison of Cache SizesProcessor Type
Year of Introduction
L1 cachea L2 cache L3 cache
IBM 360/85 Mainframe 1968 16 to 32 KB — —
PDP-11/70 Minicomputer 1975 1 KB — —
VAX 11/780 Minicomputer 1978 16 KB — —
IBM 3033 Mainframe 1978 64 KB — —
IBM 3090 Mainframe 1985 128 to 256 KB — —
Intel 80486 PC 1989 8 KB — —
Pentium PC 1993 8 KB/8 KB 256 to 512 KB —
PowerPC 601 PC 1993 32 KB — —
PowerPC 620 PC 1996 32 KB/32 KB — —
PowerPC G4 PC/server 1999 32 KB/32 KB 256 KB to 1 MB 2 MB
IBM S/390 G4 Mainframe 1997 32 KB 256 KB 2 MB
IBM S/390 G6 Mainframe 1999 256 KB 8 MB —
Pentium 4 PC/server 2000 8 KB/8 KB 256 KB —
IBM SPHigh-end server/ supercomputer
2000 64 KB/32 KB 8 MB —
CRAY MTAb Supercomputer 2000 8 KB 2 MB —
Itanium PC/server 2001 16 KB/16 KB 96 KB 4 MB
SGI Origin 2001 High-end server 2001 32 KB/32 KB 4 MB —
Itanium 2 PC/server 2002 32 KB 256 KB 6 MB
IBM POWER5 High-end server 2003 64 KB 1.9 MB 36 MB
CRAY XD-1 Supercomputer 2004 64 KB/64 KB 1MB —
![Page 21: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/21.jpg)
Mapping Function
• Cache of 64kByte• Cache block of 4 bytes
—i.e. cache is 16k (214) lines of 4 bytes• 16MBytes main memory• 24 bit address
—(224=16M)
![Page 22: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/22.jpg)
Direct Mapping
• Each block of main memory maps to only one cache line—i.e. if a block is in cache, it must be in one
specific place• Address is in two parts• Least Significant w bits identify unique
word• Most Significant s bits specify one memory
block• The MSBs are split into a cache line field r
and a tag of s-r (most significant)
![Page 23: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/23.jpg)
Direct MappingAddress Structure
Tag s-r Line or Slot r Word w
8 14 2
• 24 bit address• 2 bit word identifier (4 byte block)• 22 bit block identifier
— 8 bit tag (=22-14)— 14 bit slot or line
• No two blocks in the same line have the same Tag field• Check contents of cache by finding line and checking Tag
![Page 24: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/24.jpg)
Direct Mapping Cache Organization
![Page 25: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/25.jpg)
Direct Mapping Example
![Page 26: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/26.jpg)
Direct Mapping pros & cons
• Simple• Inexpensive• Fixed location for given block
—If a program accesses 2 blocks that map to the same line repeatedly, cache misses are very high
![Page 27: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/27.jpg)
Associative Mapping
• A main memory block can load into any line of cache
• Memory address is interpreted as tag and word
• Tag uniquely identifies block of memory• Every line’s tag is examined for a match• Cache searching gets expensive
![Page 28: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/28.jpg)
Fully Associative Cache Organization
![Page 29: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/29.jpg)
Associative Mapping Example
![Page 30: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/30.jpg)
Pentium 4 Cache• 80386 – no on chip cache• 80486 – 8k using 16 byte lines and four way set
associative organization• Pentium (all versions) – two on chip L1 caches
—Data & instructions• Pentium III – L3 cache added off chip• Pentium 4
—L1 caches– 8k bytes– 64 byte lines– four way set associative
—L2 cache – Feeding both L1 caches– 256k– 128 byte lines– 8 way set associative
—L3 cache on chip
![Page 31: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/31.jpg)
Pentium 4 Block Diagram
![Page 32: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/32.jpg)
Pentium 4 Core Processor• Fetch/Decode Unit
—Fetches instructions from L2 cache—Decode into micro-ops—Store micro-ops in L1 cache
• Out of order execution logic—Schedules micro-ops—Based on data dependence and resources—May speculatively execute
• Execution units—Execute micro-ops—Data from L1 cache—Results in registers
• Memory subsystem—L2 cache and systems bus
![Page 33: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/33.jpg)
Internal Memory
![Page 34: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/34.jpg)
Semiconductor Memory Types
![Page 35: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/35.jpg)
Semiconductor Memory
• RAM —Misnamed as all semiconductor memory is
random access—Read/Write—Volatile—Temporary storage—Static or dynamic
![Page 36: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/36.jpg)
Memory Cell Operation
![Page 37: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/37.jpg)
Dynamic RAM
• Bits stored as charge in capacitors• Charges leak• Need refreshing even when powered• Simpler construction• Smaller per bit• Less expensive• Need refresh circuits• Slower• Main memory• Essentially analogue
—Level of charge determines value
![Page 38: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/38.jpg)
Dynamic RAM Structure
![Page 39: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/39.jpg)
DRAM Operation• Address line active when bit read or written
—Transistor switch closed (current flows)• Write
—Voltage to bit line– High for 1 low for 0
—Then signal address line– Transfers charge to capacitor
• Read—Address line selected
– transistor turns on—Charge from capacitor fed via bit line to sense amplifier
– Compares with reference value to determine 0 or 1—Capacitor charge must be restored
![Page 40: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/40.jpg)
Static RAM
• Bits stored as on/off switches• No charges to leak• No refreshing needed when powered• More complex construction• Larger per bit• More expensive• Does not need refresh circuits• Faster• Cache• Digital
—Uses flip-flops
![Page 41: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/41.jpg)
Stating RAM Structure
![Page 42: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/42.jpg)
Static RAM Operation• Transistor arrangement gives stable logic
state• State 1
—C1 high, C2 low—T1 T4 off, T2 T3 on
• State 0—C2 high, C1 low—T2 T3 off, T1 T4 on
• Address line transistors T5 T6 is switch• Write – apply value to B & compliment to
B• Read – value is on line B
![Page 43: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/43.jpg)
SRAM v DRAM
• Both volatile—Power needed to preserve data
• Dynamic cell —Simpler to build, smaller—More dense—Less expensive—Needs refresh—Larger memory units
• Static—Faster—Cache
![Page 44: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/44.jpg)
Read Only Memory (ROM)
• Permanent storage—Nonvolatile
• Microprogramming (see later)• Library subroutines• Systems programs (BIOS)• Function tables
![Page 45: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/45.jpg)
Types of ROM
• Written during manufacture—Very expensive for small runs
• Programmable (once)—PROM—Needs special equipment to program
• Read “mostly”—Erasable Programmable (EPROM)
– Erased by UV—Electrically Erasable (EEPROM)
– Takes much longer to write than read—Flash memory
– Erase whole memory electrically
![Page 46: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/46.jpg)
Organisation in detail
• A 16Mbit chip can be organised as 1M of 16 bit words
• A bit per chip system has 16 lots of 1Mbit chip with bit 1 of each word in chip 1 and so on
• A 16Mbit chip can be organised as a 2048 x 2048 x 4bit array—Reduces number of address pins
– Multiplex row address and column address– 11 pins to address (211=2048)– Adding one more pin doubles range of values so x4
capacity
![Page 47: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/47.jpg)
Typical 16 Mb DRAM (4M x 4)
![Page 48: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/48.jpg)
Packaging
![Page 49: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/49.jpg)
256kByte Module Organisation
![Page 50: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/50.jpg)
1MByte Module Organisation
![Page 51: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/51.jpg)
Advanced DRAM Organization
• Basic DRAM same since first RAM chips• Enhanced DRAM
—Contains small SRAM as well—SRAM holds last line read (c.f. Cache!)
• Cache DRAM—Larger SRAM component—Use as cache or serial buffer
![Page 52: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/52.jpg)
Synchronous DRAM (SDRAM)• Access is synchronized with an external clock• Address is presented to RAM• RAM finds data (CPU waits in conventional DRAM)• Since SDRAM moves data in time with system
clock, CPU knows when data will be ready• CPU does not have to wait, it can do something
else• Burst mode allows SDRAM to set up stream of
data and fire it out in block• DDR-SDRAM sends data twice per clock cycle
(leading & trailing edge)
![Page 53: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/53.jpg)
SDRAM
![Page 54: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/54.jpg)
DDR SDRAM
• SDRAM can only send data once per clock• Double-data-rate SDRAM can send data
twice per clock cycle—Rising edge and falling edge
![Page 55: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/55.jpg)
External Memory
![Page 56: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/56.jpg)
Types of External Memory
• Magnetic Disk—RAID—Removable
• Optical—CD-ROM—CD-Recordable (CD-R)—CD-R/W—DVD
• Magnetic Tape
![Page 57: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/57.jpg)
Magnetic Disk
• Disk substrate coated with magnetizable material (iron oxide…rust)
• Substrate used to be aluminium• Now glass
—Improved surface uniformity– Increases reliability
—Reduction in surface defects– Reduced read/write errors
—Lower flight heights (See later)—Better stiffness—Better shock/damage resistance
![Page 58: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/58.jpg)
Read and Write Mechanisms• Recording & retrieval via conductive coil called a head• May be single read/write head or separate ones• During read/write, head is stationary, platter rotates• Write
— Current through coil produces magnetic field— Pulses sent to head— Magnetic pattern recorded on surface below
• Read (contemporary)— Separate read head, close to write head— Partially shielded magneto resistive (MR) sensor— Electrical resistance depends on direction of magnetic field— High frequency operation
– Higher storage density and speed
![Page 59: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/59.jpg)
Inductive Write MR Read
![Page 60: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/60.jpg)
Data Organization and Formatting
• Concentric rings or tracks—Gaps between tracks—Reduce gap to increase capacity—Same number of bits per track (variable
packing density)—Constant angular velocity
• Tracks divided into sectors• Minimum block size is one sector• May have more than one sector per block
![Page 61: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/61.jpg)
Disk Data Layout
![Page 62: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/62.jpg)
Disk Velocity• Bit near centre of rotating disk passes fixed point
slower than bit on outside of disk• Increase spacing between bits in different tracks • Rotate disk at constant angular velocity (CAV)
—Gives pie shaped sectors and concentric tracks— Individual tracks and sectors addressable—Move head to given track and wait for given sector—Waste of space on outer tracks
– Lower data density
• Can use zones to increase capacity—Each zone has fixed bits per track—More complex circuitry
![Page 63: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/63.jpg)
Disk Layout Methods Diagram
![Page 64: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/64.jpg)
Winchester Disk FormatSeagate ST506
![Page 65: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/65.jpg)
Characteristics
• Fixed (rare) or movable head• Removable or fixed• Single or double (usually) sided• Single or multiple platter• Head mechanism
—Contact (Floppy)—Fixed gap—Flying (Winchester)
![Page 66: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/66.jpg)
Multiple Platter
• One head per side• Heads are joined and aligned• Aligned tracks on each platter form
cylinders• Data is striped by cylinder
—reduces head movement—Increases speed (transfer rate)
![Page 67: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/67.jpg)
Multiple Platters
![Page 68: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/68.jpg)
Speed
• Seek time—Moving head to correct track
• (Rotational) latency—Waiting for data to rotate under head
• Access time = Seek + Latency• Transfer rate
![Page 69: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/69.jpg)
Timing of Disk I/O Transfer
![Page 70: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/70.jpg)
RAID
• Redundant Array of Independent Disks • Redundant Array of Inexpensive Disks• 6 levels in common use• Not a hierarchy• Set of physical disks viewed as single
logical drive by O/S• Data distributed across physical drives• Can use redundant capacity to store parity
information
![Page 71: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/71.jpg)
RAID 0
• No redundancy• Data striped across all disks• Round Robin striping• Increase speed
—Multiple data requests probably not on same disk
—Disks seek in parallel—A set of data is likely to be striped across
multiple disks
![Page 72: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/72.jpg)
RAID 1
• Mirrored Disks• Data is striped across disks• 2 copies of each stripe on separate disks• Read from either• Write to both• Recovery is simple
—Swap faulty disk & re-mirror—No down time
• Expensive
![Page 73: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/73.jpg)
RAID 2
• Disks are synchronized• Very small stripes
—Often single byte/word• Error correction calculated across
corresponding bits on disks• Multiple parity disks store Hamming code
error correction in corresponding positions• Lots of redundancy
—Expensive—Not used
![Page 74: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/74.jpg)
RAID 3
• Similar to RAID 2• Only one redundant disk, no matter how
large the array• Simple parity bit for each set of
corresponding bits• Data on failed drive can be reconstructed
from surviving data and parity info• Very high transfer rates
![Page 75: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/75.jpg)
RAID 4
• Each disk operates independently• Good for high I/O request rate• Large stripes• Bit by bit parity calculated across stripes
on each disk• Parity stored on parity disk
![Page 76: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/76.jpg)
RAID 5
• Like RAID 4• Parity striped across all disks• Round robin allocation for parity stripe• Avoids RAID 4 bottleneck at parity disk• Commonly used in network servers
• N.B. DOES NOT MEAN 5 DISKS!!!!!
![Page 77: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/77.jpg)
RAID 6
• Two parity calculations• Stored in separate blocks on different
disks• User requirement of N disks needs N+2• High data availability
—Three disks need to fail for data loss—Significant write penalty
![Page 78: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/78.jpg)
RAID 0, 1, 2
![Page 79: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/79.jpg)
RAID 3 & 4
![Page 80: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/80.jpg)
RAID 5 & 6
![Page 81: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/81.jpg)
Data Mapping For RAID 0
![Page 82: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/82.jpg)
Optical Storage CD-ROM
• Originally for audio• 650Mbytes giving over 70 minutes audio• Polycarbonate coated with highly
reflective coat, usually aluminium• Data stored as pits• Read by reflecting laser• Constant packing density• Constant linear velocity
![Page 83: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/83.jpg)
CD Operation
![Page 84: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/84.jpg)
CD-ROM Drive Speeds
• Audio is single speed—Constant linier velocity—1.2 ms-1
—Track (spiral) is 5.27km long—Gives 4391 seconds = 73.2 minutes
• Other speeds are quoted as multiples• e.g. 24x• Quoted figure is maximum drive can
achieve
![Page 85: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/85.jpg)
CD-ROM Format
• Mode 0=blank data field• Mode 1=2048 byte data+error correction• Mode 2=2336 byte data
![Page 86: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/86.jpg)
DVD - what’s in a name?
• Digital Video Disk—Used to indicate a player for movies
– Only plays video disks
• Digital Versatile Disk—Used to indicate a computer drive
– Will read computer disks and play video disks
![Page 87: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/87.jpg)
DVD - technology
• Multi-layer• Very high capacity (4.7G per layer)• Full length movie on single disk
—Using MPEG compression• Movies carry regional coding• Players only play correct region films
![Page 88: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/88.jpg)
CD and DVD
![Page 89: Dr Mohamed Menacer College of Computer Science and Engineering, Taibah University eazmm@hotmail.com, . eazmm@hotmail.com CS-334: Computer](https://reader035.vdocuments.mx/reader035/viewer/2022081602/551b939a550346a10a8b5ab7/html5/thumbnails/89.jpg)
Magnetic Tape
• Serial access• Slow• Very cheap• Backup and archive