Lecture14IOBenchmarks,Busses,andAutomatedData.pptVIP

Lecture 14:  I/O Benchmarks, Busses, and Automated Data Libraries Professor David A. Patterson Computer Science 252 Spring 1998 Review: A Little Queuing Theory Queuing models assume state of equilibrium: input rate = output rate Notation: r average number of arriving customers/secondTser average time to service a customer (tradtionally μ = 1/ Tser )u server utilization (0..1): u = r x Tser Tq average time/customer in queue Tsys average time/customer in system: Tsys = Tq + TserLq average length of queue: Lq = r x Tq Lsys average length of system : Lsys = r x Tsys Little’s Law: Lengthsystem = rate x Timesystem (Mean number customers = arrival rate x mean service time) Review: Redundant Arrays of Disks (RAID) Techniques Review: RAID RAID sales 1993: $3.4 billion on 214,667 arrays (- $15,000 / RAID) 1996 forecast: $11 billion 1997 forecast: $13 billion on 837,155 units Source: DISK/TREND, 5/94 (415-961-6209) Review: Storage System Issues Historical Context of Storage I/O Secondary and Tertiary Storage Devices Storage I/O Performance Measures Processor Interface Issues A Little Queuing Theory Redundant Arrarys of Inexpensive Disks (RAID) ABCs of UNIX File Systems I/O Benchmarks Comparing UNIX File System Performance I/O Buses ABCs of UNIX File Systems Key Issues File vs. Raw I/O File Cache Size Policy Write Policy Local Disk vs. Server Disk File vs. Raw: File system access is the norm: standard policies apply Raw: alternate I/O system to avoid file system, used by data bases File Cache Size Policy % of main memory dedicated to file cache is fixed at system generation (e.g., 10%) % of main memory for file cache varies depending on amount of file I/O (e.g., up to 80%) ABCs of UNIX File Systems Write Policy File Storage should be permanent; either write immediately or flush file cache after fixed period (e.g., 30 seconds) Write Through with Write Buffer Write Back Write Buffer often confused with Write Back Write Through with Write Buffer, all writes go to disk