Abstract
Large arrays of small disks axe providing an attractive approach for high performance I/O systems. In order to make effective use of disk arrays and other multi-disk architectures, it is necessary to develop intelligent software tools that allow automatic tuning of the disk arrays to varying workloads. In this paper we describe an adaptive method for data allocation and load balancing in disk arrays. Our method deals with dynamically changing access frequencies of files by reallocating file extents, thus ”cooling down” hot disks. In addition, the method takes into account the fact that some files may exhibit periodical access patterns, and considers explicitly the cost of performing the ”cooling” operations. Preliminary performance studies based on real-life I/O traces demonstrate the effectivity of this approach.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baker, M.G., Hartman, J.H., Kupfer, M.D., Shirriff, K.W., and Ousterhout, J.K., “Measurements of a Distributed File System,” Proc. of the Thirteenth ACM Symposium on Operating Systems Principles, 1991.
Chen, P.M. and Patterson, D.A.,“ Maximizing Performance in a Striped Disk-Array,” Proc. of the 17th Int. Symposium on Computer Architecture, 1990.
Copeland, G., Alexander, W., Boughter, E., and Keller, T., “Data Placement in Bubba,” Proc. ACM SIGMOD Int. Conf., 1988.
DeWitt, D.J. and Gray, J.N., “Parallel Database Systems: The Future of High Performance Database Systems,” Communications of the ACM, Vol. 35, No. 6, 1992.
Dowdy, L.W. and Foster, D.V.,“ Comparative Models of the File Assignment Problem,” ACM Computing Surveys, Vol. 14, No. 2, 1982.
Ghandeharizadeh, S. and DeWitt, D.J., “Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines,” Proc. 16th Int. Conf. on Very Large Data Bases, 1990.
Gray, J.N., Horst B., and Walker, M., “Parity Striping of Disc Arrays: Low-Cost Reliable Storage with Acceptable Throughput,” Proc. 16th Int. Conf. on Very Large Data Bases, 1990.
Highleyman, W., “Performance Analysis of Transaction Processing Systems,” Prentice Hall, 1989.
Hsiao, H. and DeWitt, D.J., “Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines,” Proc. 6th IEEE Int. Conf. on Data Engineering, 1990.
Hsiao, H. and DeWitt, D.J., “A Performance Study of Three High-Availability Data Replication Strategies,” Journal on Distributed and Parallel Databases, Vol. 1, No. 1, 1993
Holland, M. and Gibson, G.A., ”Parity Declustering for Continuous Operation in Redundant Disk Arrays,” Proc. 5th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, 1992.
Katz, R.H.,“ High Performance Network and Channel-based Storage,” Sequoia 2000 Technical Report #91/2, University of California at Berkeley, 1991.
Katz, R.H., Gibson, G.A., and Patterson, D.A., “Disk System Architectures for High Performance Computing”, Proc. of the IEEE, Vol. 77, No. 12, 1989.
Kim, M.Y.,“Synchronized Disk Interleaving,” IEEE Transactions on Computers, Vol. C-35, No. 11, 1986.
Livny, M., Khoshafian, S., and Boral, H., “Multi-Disk Management Algorithms,” ACM SIGMETRICS Int. Conf., 1987.
Muntz, R.R. and Lui, J.C., “Performance Analysis of Disk Arrays Under Failure,” Proc. 16th Int. Conf. on Very large Databases, 1990.
Merchant, A. and Yu, P.S., “Design and Modeling of Clustered RAID,” Proc. 22nd IEEE Int. Conf. on Fault-Tolerant Computing Systems, 1992.
Merchant, A. and Yu, P.S.,“Performance Analysis of a Dual Striping Strategy for Replicated Disk Arrays,” Proc. 2nd Int. Conf. on Parallel and Distributed Information Systems, 1993.
Patterson, D.A., Gibson, G., and Katz, R.H., “A Case for Redundant Arrays of Inexpensive Disks (RAID),” Proc. ACM SIGMOD Int. Conf., 1988.
Salem, K., and Garcia-Molina, H.,“Disk Striping,” Proc. 2nd Int. Conf. on Data Engineering, 1986.
Scheuermann, P., Park, Y.C. and Omiecinski, E., “A Heuristic File Reorganization Algorithm based on Record Clustering,” BIT, Vol. 29, 1989.
Scheuermann, P., Weikum, G., and Zabback, P., “Automatic Tuning of Data Placement and Load Balancing in Disk Arrays,” Database Systems for Next-Generation Applications — Principles and Practice, Advanced Database Research and Development Series (edited by W. Kim and Y. Kambayashi), World Scientific Publications.
Weikum, G., Hasse, C., Moenkeberg, A., Rys, R., and Zabback, P., “The COMFORT Project: Project Synopsis”, Proc. 2nd Int. Conf. on Parallel and Distributed Information Systems, 1993.
Weikum, G., Zabback, P., and Scheuermann, P., “Dynamic File Allocation in Disk Arrays,” Proc. ACM SIGMOD Int. Conf., 1991.
Weikum, G., and Zabback, P., “Tuning of Striping Units in Disk-Array-Based File Systems,” Proc. 2nd Int. Workshop on Research Issues on Data Engineering: Transaction and Query Processing (RIDE-TQP), 1992.
Wolf, J., “The Placement Optimization Program: A Practical Solution to the Disk File Assignment Problem,” Proc. ACM SIGMETRICS Int. Conf., 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheuermann, P., Weikum, G., Zabback, P. (1993). Adaptive load balancing in disk arrays. In: Lomet, D.B. (eds) Foundations of Data Organization and Algorithms. FODO 1993. Lecture Notes in Computer Science, vol 730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57301-1_23
Download citation
DOI: https://doi.org/10.1007/3-540-57301-1_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57301-2
Online ISBN: 978-3-540-48047-1
eBook Packages: Springer Book Archive