Disk subsystem load balancing: disk striping vs. conventional data placement

To provide improved input/output performance, as well as to accommodate growing storage requirements, disk subsystems are increasing in size. A major hurdle to obtaining the performance available from these large disk subsystems is load imbalance, or disk skew. Dynamic data placement, the conventional load balancing technique, is usually adequate to deal with load imbalance because it is forced to accept atomic data sets with rapidly changing access patterns. The authors name this rapid fluctuation 'floating load imbalance' and distinguish it from the conventional view of load imbalance, referred to as 'fixed load imbalance'. Disk striping at a high granularity is suggested as a solution to floating load imbalance, the atomic data set problem and the complexity of balancing large disk subsystems. Disk striping uniformly spreads data sets across the disks in the subsystem and essentially randomizes, the disk accessed by each request. This randomization effectively handles both fixed and floating load imbalance.<<ETX>>

[1]  Songnian Zhou An Experimental Assessment of Resource Queue Lengths as Load Indices , 1986 .

[2]  Michelle Y. Kim,et al.  Synchronized Disk Interleaving , 1986, IEEE Transactions on Computers.

[3]  Bruce McNutt An Empirical Study of Variations in DASD Volume Activity , 1986, Int. CMG Conference.

[4]  Joseph B. Major Empirical Models of DASD Response Time , 1987, Int. CMG Conference.

[5]  Miron Livny,et al.  Multi-disk management algorithms , 1987, SIGMETRICS '87.

[6]  S. Zhou,et al.  A Trace-Driven Simulation Study of Dynamic Load Balancing , 1987, IEEE Trans. Software Eng..

[7]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[8]  Songnian Zhou A Trace-Driven Simulation Study of Dynamic Load Balancing , 1988, IEEE Trans. Software Eng..

[9]  Michael McElwee The Real World of DASD Management , 1988, Int. CMG Conference.

[10]  Wayne S. Papy DASD I/O Performance Tuning: A Case Study of Techniques and Results , 1988, Int. CMG Conference.

[11]  Richard B. Wilmot File Usage Patterns from SMF Data , 1989, Int. CMG Conference.

[12]  J. Aschoff Performance Management of Storage Subsystems , 1989, Int. CMG Conference.

[13]  Joel L. Wolf,et al.  The placement optimization program: a practical solution to the disk file assignment problem , 1989, SIGMETRICS '89.

[14]  Spencer Ng,et al.  Some design issues of disk arrays , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[15]  A. L. Narasimha Reddy,et al.  An Evaluation of Multiple-Disk I/O Systems , 1989, IEEE Trans. Computers.

[16]  Jim Gray,et al.  Parity Striping of Disk Arrays: Low-Cost Reliable Storage with Acceptable Throughput , 1990, VLDB.

[17]  Jeffrey P. Buzen,et al.  I/O Performance Trade-Offs and MVS/ESA Considerations , 1990, Int. CMG Conference.

[18]  Randy H. Katz,et al.  An evaluation of redundant arrays of disks using an Amdahl 5890 , 1990, SIGMETRICS '90.

[19]  Jim Gray,et al.  The Benchmark Handbook for Database and Transaction Systems , 1993 .

[20]  Joseph L. Hellerstein,et al.  Choosing a Service Level Indicator - Why not Queue Length? , 1991, Int. CMG Conference.

[21]  J. Menon,et al.  Methods for improved update performance of disk arrays , 1992, Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences.

[22]  Jim Gray,et al.  Benchmark Handbook: For Database and Transaction Processing Systems , 1992 .

[23]  IEEE Transactions on Computers , Computing in Science & Engineering.