Abstract
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout is computed. In this work we study the data migration problem, which arises when we need to quickly change one layout to another. This problem has been studied earlier when for each disk the new layout has been prescribed. However, to apply these algorithms effectively, we identify another problem that we refer to as the correspondence problem, whose solution has a significant impact on the solution for the data migration problem. We study algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst case behavior.
This research was supported by NSF Award CCR-0113192 and ANI-0070016. This work made use of Integrated Media Systems Center Shared Facilities supported by the National Science Foundation under Cooperative Agreement No. EEC-9529152; any Opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect those of the National Science Foundation. Full version of this paper is available at: http://www.cs.umd.edu/projects/smart/papers/esa04_full.ps
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, E., Hall, J., Hartline, J., Hobbes, M., Karlin, A., Saia, J., Swaminathan, R., Wilkes, J.: An Experimental Study of Data Migration Algorithms. In: Workshop on Algorithm Engineering (2001)
Chervenak, A.L.: Tertiary Storage: An Evaluation of New Applications. Ph.D. Thesis, UC Berkeley (1994)
Ghandeharizadeh, S., Muntz, R.R.: Design and Implementation of Scalable Continuous Media Servers. Parallel Computing Journal 24(1), 91–122 (1998)
Golubchik, L., Khanna, S., Khuller, S., Thurimella, R., Zhu, A.: Approximation Algorithms for Data Placement on Parallel Disks. In: Proc. of ACM-SIAM SODA (2000)
Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: OnAlgorithms for Efficient Data Migration. In: Proc. of ACM-SIAM SODA, pp. 620–629 (2001)
Khuller, S., Kim, Y., Wan, Y.-C.: Algorithms for Data Migration with Cloning. In: 22nd ACM Symposium on Principles of Database Systems (PODS), pp. 27–36 (2003)
Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29, 442–467 (2001)
Wolf, J., Shachnai, H., Yu, P.: DASD Dancing:A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer Systems. In: ACM SIGMETRICS/Performance Conf., pp. 157–166 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golubchik, L., Khuller, S., Kim, YA., Shargorodskaya, S., Wan, YC.(. (2004). Data Migration on Parallel Disks. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive