05-Chap6-External Memory LEC 1
05-Chap6-External Memory LEC 1
Chapter 6
External Memory
Overview
• Magnetic Disk
—Magnetic Read/Write Mechanism
—Physical Characteristics
—Disk Performance Parameters
• RAID
—Level 0 to Level 6
• Optical Memory
—CD-ROM
—CD-Recordable (CD-R)
—CD-R/W
—DVD
• Magnetic Tape
Types of External Memory
• Magnetic Disk
—Hard Drive
• Optical Memory
—CD-ROM
—CD-Recordable (CD-R)
—CD-R/W
—DVD
• Magnetic Tape
Magnetic Disk
• Disk is a circular platter made of non-
magnetic material, called substrate coated
with magnetizable material (iron oxide)
• Substrate used to be aluminium Substrate is a term used
in materials science to
• Now glass describe the base material
on which processing is
• Universal
• Cheap
• Fastest external storage
• Getting larger all the time
—250 Gigabyte now easily available
Speed
• Seek time - Moving head to correct track
• Rotational latency - Waiting for data to rotate under head
• Access time = Seek + Latency
• Transfer rate
• Some other delays
— Queuing delays associated with disk I/O operation – A
process when issues I/O request may wait in a queue for device to be
available
— If a device shares single I/O channel or a set of
channels- there may be additional wait for channel to be available
Rotational Positional Sensing (RPS) RPS miss?
• Mini/Easy Homework
— Two examples under ―A timing Comparison‖ topic on page 178/179
Timing of Disk I/O Transfer
RAID
• Redundant Array of Inexpensive Disks authors
• Redundant Array of Independent Disks
• Why need RAID – speed mismatch, reliability, availability
• Multiple disks used in different schemes
• Known as levels: 6 levels in common use
• No hierarchical relationship in the levels
• Three common characteristics
—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
RAID 0 (1/3)
Disadvantage:
• one down disk will destroy the whole data
Advantages:
• Good for high transfer rate: if the typical request is for large amount of contiguous data
• Good for high I/O request rate - in transaction oriented environment the user is more
concerned with response time than with transfer rate (performance will be influenced by
stripe size, if an I/O request involves a single disk access, multiple I/O requests can be
handled in parallel and faster)
• Single request for contiguous stripe or multiple requests each requiring single disk
access can be handled in parallel
Data Mapping For RAID 0 (3/3)
RAID 1 (1/2)
• Recovery is simple
—Swap faulty disk & re-mirror - Hot swapping ?
—No down time
• Expensive
RAID 1 (2/2)
• Say there are 4 data disks D0, D1, D2, D3 and 1 parity disk P1. The parity
for the ith bit is calculated as follow: P1 (i)= D0(i) D1(i) D2(i) D3(i)
• In the event of failure the data can be easily retrieved. Suppose D1 has
failed, then the data for this disk can be retrieved by adding P1 (i)D1(i) to
both sides of the above equation, we get:
D1(i) = D0(i) D2(i) D3(i) P1 (i)
• Thus the contents of each strip of data on D1 can be regenerated from the
contents of the strips on the remaining disks
• This principle is true for levels 3 to 6
RAID 4 (1/2)
• Like RAID 4
• Parity stripes distributed across all disks
• Round robin allocation for parity stripe
• Avoids RAID 4 bottleneck at parity disk
• Commonly used in network servers