Secondary Storage : Outline ! Magnetic Tapes ! Disks rasitjutrakul - - PowerPoint PPT Presentation

secondary storage outline
SMART_READER_LITE
LIVE PREVIEW

Secondary Storage : Outline ! Magnetic Tapes ! Disks rasitjutrakul - - PowerPoint PPT Presentation

Secondary Storage : Outline ! Magnetic Tapes ! Disks rasitjutrakul Magnetic Tape " Sequential access " Compact " Easy to store and transport " Less expensive " Storing data off-line " Archival storage rasitjutrakul


slide-1
SLIDE 1 rasitjutrakul

Secondary Storage : Outline

! Magnetic Tapes ! Disks

slide-2
SLIDE 2 rasitjutrakul

Magnetic Tape "Sequential access "Compact "Easy to store and transport "Less expensive "Storing data off-line "Archival storage

slide-3
SLIDE 3 rasitjutrakul

Organization of Data on Tapes "Data are stored sequentially on a set of parallel tracks.

1 1 1 1 1 1

Gap Data block Gap Track Frame

slide-4
SLIDE 4 rasitjutrakul

Density and Capacity "Density (bytes per inch, bpi)

– the number of characters that can be recorded in an inch of tape. ( e.g. 800, 1600, 6250, 30000 bpi )

"Capacity

– the number of bytes that can be stored in the entire tape.

"Capacity = Length x Density

– (2400 x 12) x (1600 bpi) = 44 Mbytes

slide-5
SLIDE 5 rasitjutrakul

Utilization

Utilization BlockSize BlockSize GapSize = +

20 40 60 80 100 400 800 1200 1600 2000 2400 2800 3200 Block size (bytes) Utilization (% )

slide-6
SLIDE 6 rasitjutrakul

"Typical transfer rate : 10 ft / sec "However, the maximal data transfer rate (MDTR) is never attained. "Effective data transfer rate (EDTR)

– r : time to read user's data – ss: time to start and stop the tape – gt: time spent in the interblock gap

Data Transfer Rate

EDTR r r ss gt MDTR = + + ⋅

slide-7
SLIDE 7 rasitjutrakul

Effective Data Transfer Rate "BlockSize = r MDTR, GapSize = gt MDTR

EDTR r rss gt MD =++⋅

slide-8
SLIDE 8 rasitjutrakul

Effective Data Transfer Rate

EDTR r r ss gt MDTR = + + ⋅

50000 100000 150000 400 800 1200 1600 2000 2400 2800 3200 Block size (bytes) EDTR

slide-9
SLIDE 9 rasitjutrakul

Fixed-Length Records

HEADER IBG BLOCK IBG . . . BLOCK IBG TRAILER RECORD RECORD . . . RECORD

EDTR r r ss gtMDT = + + ⋅

slide-10
SLIDE 10 rasitjutrakul

Variable-Length Records

HEADER IBG BLOCK IBG BLOCK IBG IBG TRAILER BDW RDW

  • REC. 1

BDW RDW

  • REC. 1

RDW

  • REC. 2

BDW SDW1

  • REC. 1

SDW2

  • REC. 2

IBG BDW SDW2

  • REC. 2

. . .

Variable-length unspanned unblocked record format Variable-length unspanned blocked record format Variable-length spanned blocked record format

slide-11
SLIDE 11 rasitjutrakul

Magnetic Disks

1 3 2

Actuator Spindle Cylinder

Direct Access Storage Device (DASD) Direct Access Storage Device (DASD)

slide-12
SLIDE 12 rasitjutrakul

"Sector-addressing "Block-addressing Organizing Tracks

slide-13
SLIDE 13 rasitjutrakul

Organizing Tracks by Sector

1 5 2 3 4 8 7 6 1 5 4 7 2 6 3 8

Interleaving factor Interleaving factor

slide-14
SLIDE 14 rasitjutrakul

Organizing Tracks by Sector

1 2 3 4 5 1 2 3 4

sector Sector-addressing scheme Sector-addressing scheme

slide-15
SLIDE 15 rasitjutrakul

Organizing Tracks by Block

1 2 3 4 5

sector

1 2 3 4 5

block Block-addressing scheme Block-addressing scheme

slide-16
SLIDE 16 rasitjutrakul

Organizing Tracks by Block

Count subblock Data subblock Key subblock Count subblock Data subblock Key subblock Count subblock Data subblock Count subblock Data subblock block block IBG

slide-17
SLIDE 17 rasitjutrakul

"Plus :

– Physical space allocation of records corresponds to logical organization. – No internal fragmentation. – No need to load two blocks to access one record.

"Minus :

– More nondata overhead. – Extra work for programmer and file system. – Large block may cause track fragmentation.

Organizing Tracks by Block

slide-18
SLIDE 18 rasitjutrakul

"Cluster :

– a collection of contiguous blocks (or sectors)

"Extent :

– a collection of contiguous clusters.

"A file : a series of

– blocks – clusters – extents

Clusters & Extents

Minimize seek time Minimize seek time

slide-19
SLIDE 19 rasitjutrakul

"NC : Number of cylinders per disk pack "TPC

: Number of tracks per cylinder

"TC

: Capacity of each track

"DC: Disk capacity

IBM3350 : 555 cylinders, 39 tracks/cyl, 19254 bytes/track disk capacity = 397 MBytes (* including system data)

Disk Capacity

DC NC TPC TC bytes = ⋅ ⋅

slide-20
SLIDE 20 rasitjutrakul

Disk Access "Seek time

– average seek time ≈ 1/3 of the max. seek time

"Head-switching time

– negligible ≈ 0

"Rotational delay

– half a revolution (3600 rpm ≈ 8.3 msec)

"Data transfer time

– # data transferred, rotation time

slide-21
SLIDE 21 rasitjutrakul

Comparisons of Disk Drives

Speed/Capacty 3.5-inch floppy IBM 3380 Avg seek time (ms) 70 17 Rotational delay (ms) 50 8.3 Transfer rate (MB/s) 0.2 3.0 bytes/track 9,200 47,476 track/cylinder 2 15 cylinder/drive 80 1,770 MB/drive 1.4 2,520

slide-22
SLIDE 22 rasitjutrakul

"Disk performance is increasing. "But disk speeds still lag far behind CPU and local network speeds. "Techniques :

– Disk striping - splitting a file on several drives – Disk cache – RAM disk

Disk as Bottleneck

slide-23
SLIDE 23 rasitjutrakul

Device Storage Allocation "Keep track of what blocks are in use and what blocks are free.

– Bit map – Free chain

block block block block block block

...

used free

block block