DOC PREVIEW
CMU CS 15410 - Disk Arrays

This preview shows page 1-2-3-4-26-27-28-53-54-55-56 out of 56 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 56 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Slide 24Slide 25Slide 26Slide 27Slide 28Slide 29Slide 30Slide 31Slide 32Slide 33Slide 34Slide 35Slide 36Slide 37Slide 38Slide 39Slide 40Slide 41Slide 42Slide 43Slide 44Slide 45Slide 46Slide 47Slide 48Slide 49Slide 50Slide 51Slide 52Slide 53Slide 54Slide 55Slide 5615-410, F’04- 1 -Disk ArraysNov. 8, 2004Dave EckhardtDave EckhardtBruce MaggsBruce MaggsPresented by Michael Presented by Michael Ashley-RollmanAshley-RollmanL26_RAID15-410“...Failure is not an option...”15-410, F’04- 1 -SynchronizationToday: Disk ArraysToday: Disk ArraysText: 14.5 (a good start)Please read remainder of chapterwww.acnc.com 's “RAID.edu” pagesPittsburgh's own RAID vendor!www.uni-mainz.de/~neuffer/scsi/what_is_raid.htmlPapers (@ end)15-410, F’04- 1 -OverviewHistorical practicesHistorical practicesStriping, mirroringThe reliability problemThe reliability problemParity, ECC, why parity is enoughParity, ECC, why parity is enoughRAID “levels” (really: flavors)RAID “levels” (really: flavors)ApplicationsApplicationsPapersPapers15-410, F’04- 1 -StripingGoalGoalHigh-performance I/O for databases, supercomputers“People with more money than time”Problems with disksProblems with disksSeek timeRotational delayTransfer time15-410, F’04- 1 -Seek TimeTechnology issues evolve slowlyTechnology issues evolve slowlyWeight of disk headStiffness of disk armPositioning technologyHard to dramatically improve for niche customersHard to dramatically improve for niche customersSorry!Sorry!15-410, F’04- 1 -Rotational DelayHow fast How fast cancan we spin a disk? we spin a disk?Fancy motors, lots of power – spend more moneyProbably limited by data rateProbably limited by data rateSpin faster  must process analog waveforms fasterAnalog  digital via serious signal processingSpecial-purpose disks generally spin Special-purpose disks generally spin a littlea little faster faster1.5X, 2X – not 100X15-410, F’04- 1 -Transfer TimeTransfer time Transfer time Assume seek & rotation completeHow fast to transfer ____ kilobytes?How to transfer faster?How to transfer faster?15-410, F’04- 1 -Parallel Transfer?Reduce transfer time (without spinning faster)Reduce transfer time (without spinning faster)Read from multiple heads at same time?Read from multiple heads at same time?Practical problemPractical problemDisk needs N copies of analog  digital hardwareExpensive, but we have some money to burnMarketing wants to know...Marketing wants to know...Do we have enough money to buy a new factory?Can't we use our existing product somehow?15-410, F’04- 1 -StripingGoalGoalHigh-performance I/O for databases, supercomputersSolution: parallelismSolution: parallelismGang multiple disks together15-410, F’04- 1 -StripingCa ffei en15-410, F’04- 1 -StripingStripe Stripe unitunit (what each disk gets) can vary (what each disk gets) can varyByteBitSector (typical)Stripe Stripe sizesize = stripe unit X #disks = stripe unit X #disksBehavior: “fat sectors”Behavior: “fat sectors”File system maps bulk data request  N disk operationsEach disk reads/writes 1 sector15-410, F’04- 1 -Striping ExampleSimple case – stripe sectorsSimple case – stripe sectors4 disks, stripe unit = 512 bytesStripe size = 2KResultsResultsSeek time: 1X base case (ok)Transfer rate: 4X base case (great!)But there's a problem...But there's a problem...15-410, F’04- 1 -High-Performance StripingRotational delay Rotational delay gets worsegets worseStripe not done until fourth disk rotates to right placeI/O to 1 disk pays average rotational cost (50%)N disks converge on worst-case rotational cost (100%)Spindle synchronization!Spindle synchronization!Make sure N disks are always alignedSector 0 passes under each head at “same” timeResultResultCommodity disks with extra synchronization hardwareNot insanely expensive  some supercomputer applications15-410, F’04- 1 -Less Esoteric Goal: CapacityUsers always want more disk spaceUsers always want more disk spaceEasy answerEasy answerBuild a larger disk!IBM 3380 (early 1980's)14-inch platter(s)Size of a refrigerator1-3 GByte (woo!)““Marketing on line 1”...Marketing on line 1”...These monster disks sure are expensive to build!Especially compared to those dinky 5¼-inch PC disks... Can't we hook small disks together like last time?15-410, F’04- 1 -Striping Example RevisitedSimple case – stripe sectors Simple case – stripe sectors 4 disks, stripe unit = 512 bytesStripe size = 2KResultsResultsSeek time: 1X base case (ok)Rotation time : 1X base case using special hardware (ok)Transfer rate: 4X base case (great!)Capacity: 4X base case (great!)NowNow what could go wrong? what could go wrong?15-410, F’04- 1 -The Reliability ProblemMTTF = Mean time to failureMTTF = Mean time to failureMTTF(array) = MTTF(disk) / #disksMTTF(array) = MTTF(disk) / #disksExample from original 1988 RAID paperExample from original 1988 RAID paperConner Peripherals CP3100 (100 megabytes!)MTTF = 30,000 hours = 3.4 yearsArray of 100 CP3100'sArray of 100 CP3100's10 Gigabytes (good)MTTF = 300 hours = 12.5 days (not so good)Reload file system from tape every 2 weeks???15-410, F’04- 1 -MirroringCopy ACopy B15-410, F’04- 1 -MirroringOperationOperationWrite: write to both mirrorsRead: read from either mirrorCost per byte Cost per byte doublesdoublesPerformancePerformanceWrites: a little slowerReads: maybe 2X fasterReliability Reliability vastlyvastly increased increased15-410, F’04- 1 -MirroringWhen a disk breaksWhen a disk breaksIdentify it to system administratorBeep, blink a lightSystem administrator provides blank diskCopy contents from surviving mirrorResultResultExpensive but safeBanks, hospitals, etc.Home PC users???15-410, F’04- 1 -Error CodingIf you are good at mathIf you are good at mathError Control Coding: Fundamentals & ApplicationsLin, Shu, & CostelloIf you are like meIf you are like meCommonsense Approach to the Theory of Error Correcting CodesArazi15-410, F’04- 1 -Error Coding In One Easy LessonData vs. messageData vs. messageData = what you want to conveyMessage = data


View Full Document

CMU CS 15410 - Disk Arrays

Download Disk Arrays
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Disk Arrays and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Disk Arrays 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?