MULTIMEDIA STORAGE AND RETRIEVAL

INTRODUCTION
High performance CPU,Storage Medium Max computation rateCPU Performance,Memory Bus Bandwidth,Video Bandwidth etc Isochronous delivery of audio and video objects Broadly usedMagnetic disks

MAGNETIC MEDIA TECHNOLOGY

Reduction in price per megabyte of high capacity storage Low cost,High capacity Multimedia magnetic disk storage systemsSLEDs(Single Large Expensive Disks) and RAIDs(Redundant Array of Inexpensive Disks)

HARD DISK TECHNOLOGY

Faster mass storage medium ST506 and MFM Hard drives ESDI Hard drive IDE New Enhanced IDE Interface SCSI SCSI-2

ST506 AND MFM Hard Drives

Interfacedefines the signals and operation of signals b/w hard disk controller and hard disk Simple,Controls platter speed and movement of heads for a drive It doesnt define the format of data stored on the platter

How data stored on the platter?? Encoding Schemes

MFM Parallel Data-Series of encoded pulsesMFM(Modified Frequency Modulation)/FM Data Separator Circuitryseparates data from sector info Drive Capacity--10MB-100MB RLL(Run Length Limited)Packs 50% more bits than MFM Drive Capacity20MB-200MB

ESDI (Enhanced Small Device Interface)-Hard Drive

Improvement over ST506Faster drives and larger storage capacity Converts data into serial bit streams and uses RLL for encoding Defect mapContains locations of bad or defective sectors on the drive Supplies cylinder and sector information to controller Data separator circuitry is a part of drive Drive Capacity80MB-2GB

IDE(Integrated Device Electronics)

Integrated controller Parallel data interface-16 bit Driver Capacity40MB-528MB Supports 2 Drives1 Master and the other Slave Disadvantage:
Jumper settings::add drivephysically removing the drive to change jumper setting Allows only two drives

Advantage:
Both hardware and software interfaces are very simplelow cost hard disk controller

New Enhanced IDE Interface

Maximum capacity around 8GB Supports upto 4 drives Also supports CD ROM and Tape drives

SCSI(Small Computer System Interface)

Used for large volume storage appsin RAID as well as optical disks Drive Capacity20MB-2GB

SCSI--2
Its SCSI1 with faster data transfer rates,wider data paths Two connector approach Advantage::
SCSI-2 is back compatible with SCSI-1

Disadvantage::
Wide SCSI-2 has not happened yet

Why SCSI1 & SCSI2 standards important to multimedia??

Uses single bus for connecting different multimedia i/p,o/p devices

Rich commom command set to support all devices Offers performance upto 10MB/sec with standard 8bit transfers and 40MB/sec in fast and wide mode Allows definition of vendor-unique command sets to control special devices or special features The tagged command queuing can improve performance

Storage Densities and Latencies

Seek latencies::
Overlapped seek:seek on one drive ad then on second drive and then reconnect to first drive when the seek is complete Midtransfer seek:device controller can be set to seek during data transfer via a separate port provided on SCSI chip Elevator seek:A track close to the head will be read first and then a more distant track although the distant track is requested first

Storage Densities and Latencies

Rotational latencies:: Zero latency read/write:Zero latency reads allow transferring data as soon as the head settles instead of waiting a disk revolution for the proper sector Interleave factor:Keep up with the data stream without skipping sectors

Storage Densities and Latencies

Transfer rate and I/O per second:rate at which data is transferred from the drive buffer to the host adapter memory Max throughput:number of bytes transferred per second Max Throughput for I/O=Block Transfer Size/Total Latency Where Total Latency=T1+T2+T3+T4+T5 T1=seek latency T2=rotational latency T3=time required to transfer data from disk to CPUs system memory T4=firmware latency to setup transfer and complete transaction T5=Final action on data eg:Display

Storage Densities and Latencies

I/O per second:

Its a measure of the number of input/output transactions performed in a second
I/O per second=Max or overall throughput/block size

Storage Densities and Latencies

Data Management: A number of activities are involved in the data management as Command queuing:Allows execution of multiple sequential commands with system CPU intervention.Its helps in minimising head switching and disk rotational latency Scatter gather:Scatter is a process whereby data is set for best fit in the available block of memory or disk.Gather reassembles data into contiguous blocks on disk or in memory

Seek ,Rotational and Data transfer Relationships

Data transfer

I/O %

Rotational latency

Total access time

Seek latency

Data block size increasing

Disk Spanning
Method of attaching multiple drives to a single host adapter All drives appear as a single contiguous logical unit Order of data writingFirst drive first until its full then to 2nd and so on Good way of increasing storage capacity by adding incremental drives Doesnt offer fault tolerance or reliability(goes down) due to combined MTBF MTBF=MTBF of single drive/Total no of drives

RAID (redundant array of independent disks)

Redundant array of inexpensive disks Multiple disk database design Not a hierarchy 7 levels (6 levels in common use) Set of physical disk drives viewed by the OS as a single logical drive Data are distributed across the physical drives of an array Redundant disk capacity is used to store parity information => data recoverability Improve access time and improve reliability

RAID Level 0Disk striping

Not a true member of the RAID family - does not include redundancy to improve performance. User and system data distributed across all disks in the array in strips. Imagine a large logical disk containing ALL data. This is divided into strips (physical blocks or sectors) that are mapped round robin to the strips in the array. A set of logically consecutive strips that maps exactly one strip to each array member is referred to as a stripe. + If two different I/O requests are pending for two different blocks of data then there is a good chance that the data will be on different disks and can be serviced in parallel. + If a single I/O request is for multiple logically continuous strips up to n strips can be handled in parallel.

RAID Level 0
This software may execute either in the disk sub system or in a host computer

RAID Level 1Disk mirroring

Redundancy achieved through duplicating all data. Data stripping is similar to RAID level 0. Each logic strip is mapped to two physical disks. Read request can be serviced from either of available 2 disks, which ever involves the minimum seek time and rotational latency Write request requires both disks to be updated but this can be done in parallel. (Slower write dictates overall speed). Recover from failure is simple! (data may still be accessed from the second drive Disadvantage: Cost requires twice the disk space Configuration is limited, so used only for system software and other highly critical files. Improvement occurs if the application can split each read request so that both disk members participate

RAID Level 1

RAID Level 2Bit interleaving of data

Utilizes parallel access techniques - All disks participate in the execution of every I/O request. Spindles of individual drives are synchronized so that each disk head is in the same position on each disk at any given time. Data striping very small strips (single byte or word). Error correcting code is calculated across corresponding bits on each disk, and the code bits are stored in corresponding bit positions on multiple parity disks. For Hamming Code number of parity (redundant) disks is proportionate to the log of the number of data disks. On a single read, all disks are simultaneously accessed. The requested data and the associated error correcting code are delivered to the array controller. Array controller can detect and fix single bit errors. For write all disks must be accessed. Good choice only for an environment in which many errors occur therefore not used much (given high reliability if individual disks and disk drives).

RAID Level 2

RAID Level 3Parity drives

Similar to RAID 2 parallel access with data distributed in small strips. Requires only a single redundant disk because it uses a single parity bit for the set of individual bits in the same position on all of the data disks. If drives X0-X3 contain data, and X4 contains parity bits. X4(i) = X3(i) X2(i) X1(i) X0(i) Redundancy in the case of disk failure, the data can be reconstructed. If drive X1 fails it can be reconstructed as: X1(i) = X4(i) X3(i) X2(i) X0(i) Performance can achieve high transfer rates, but only one I/O request can be executed at one time. (Better for large data transfers in non transactionoriented environments).

RAID Level 4sector interleaving with dedicated parity drives

Each disk operates independently - Separate I/O requests satisfied in parallel. Suitable for applications with high I/O request rates and NOT well suited for those requiring high data transfer rates. Data striping. (Strips are larger than in lower RAIDs). Bit-by-bit parity strip is calculated across corresponding strips on each data disk, and stored in corresponding strip on the parity disk. Performance write penalty when I/O request is small size. Write must update user data + corresponding parity bits. X4(i) = X3(i) X2(i) X1(i) X0(i) If X1(i) is changed to X1(i) X4(i) = X3(i) X2(i) X1(i) X0(i) = X4(i) X1(i) X1(i) To calculate new parity, the old user data,new user data and old parity strips must be read. Then it can update these two strips with the new data and the newly calculated parity. Thus each strip write involves two reads and two writes.

RAID Level 5Block interleaving of data

Same as RAID 4 but parity strips are distributed across all disks. Typical allocation uses round-robin. For an n-disk array, the parity strip is on a different disk for the first n strips and the pattern then repeats. Avoids potential bottleneck found in RAID 4.

RAID Level 6
Two different parity calculations are carried out and stored in separate blocks on different disks. Example: XOR and an independent data check algorithm => makes it possible to regenerate data even if two disks containing user data fail. No. of disks required = N + 2 (where N = number of disks required for data). Provides HIGH data availability. Incurs substantial write penalty as each write affects two parity blocks.

COMPARISON OF RAID LEVELS

COMPARISON OF RAID LEVELS