Data migration on parallel disks: Algorithms and evaluation

Algorithmica (New York)

Volumn 45, Issue 1, 2006, Pages 137-158

  Golubchik, Leana ^a   Khuller, Samir ^b   Kim, Yoo Ah ^b   Shargorodskaya, Svetlana ^c   Wan, Yung Chun ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b Institute of Advanced Computer Science   (United States)

^c NONE

Author keywords

Approximation algorithms; Data migration; Data movement; Data placement; Load balancing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; MULTIMEDIA SYSTEMS; SERVERS;

APPROXIMATION ALGORITHMS; DATA MIGRATION; DATA MOVEMENT; LOAD BALANCING;

DATA ACQUISITION;

EID: 33646386956     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1194-6     Document Type: Article

References (16)

1. E. Anderson, J. Hall, J. Hartline, M. Hobbes, A. Karlin, J. Saia, R. Swaminathan, and J. Wilkes. An experimental study of data migration algorithms. Workshop on Algorithm Engineering, pp. 145-158. LNCS 2141. Springer, New York, 2001.
2. C. Berge and J. C. Fournier. A short proof for a generalization of Vizing's theorem. Journal of Graph Theory, 15(3):333-336 (1991).
3. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier, New York, 1977.
4. A. L. Chervenak. Tertiary Storage: An Evaluation of New Applications. Ph.D. Thesis, UC Berkeley, 1994.
5. C.-F. Chou, L. Golubchik, J. C. S. Lui, and I.-H. Chung. Design of scalable continuous media servers. Multimedia Tools and Applications. 17(2-3):181-212, 2002.
6. S. Ghandeharizadeh and R. R. Muntz. Design and implementation of scalable continuous media servers. Parallel Computing Journal 24(1):91-122, 1998.
7. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu. Approximation algorithms for data placement on parallel disks. Proc. of ACM-SIAM SODA, pp. 223-232, 2000.
8. J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes. On algorithms for efficient data migration. Proc. of ACM-SIAM SODA, pp. 620-629, 2001.
9. S. Kashyap and S. Khuller. Algorithms for non-uniform size data placement on parallel disks. Proc. of Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), pp. 265-276. LNCS 2914. Springer, Berlin, 2003.
10. S. Khuller, Y. Kim, and Y-C. Wan. Algorithms for data migration with cloning. Proc. of 22nd ACM Symposium on Principles of Database Systems (PODS), pp. 27-36, 2003.
11. H. Shachnai and T. Tamir. Polynomial time approximation schemes for class-constrained packing problems. Proc. of Workshop on Approximation Algorithms, pp. 238-249. LNCS 1913, Springer, Berlin, 2000.
12. H. Shachnai and T. Tamir. On two class-constrained versions of the multiple knapsack problem. Algorithmica, 29:442-467, 2001.
13. H. Shachnai and T. Tamir. Approximation schemes for generalized 2-dimensional vector packing with application to data placement. Proc. of Workshop on Approximation Algorithms, pp. 165-177. LNCS 2764. Springer, Berlin, 2003.
14. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem Mathematical Programming, 62:461-474, 1993.
15. V. G. Vizing. On an estimate of the chromatic class of a p-graph (Russian). Diskretnaya Analiz., 3:25-30, 1964.
16. J. Wolf, H. Shachnai, and P. Yu. DASD dancing: a disk load balancing optimization scheme for video-on-demand computer systems. Proc. of ACM SIGMETRICS/Perfonnance Conference, pp. 157-166, 1995.