Algorithms for data migration

Algorithmica (New York)

Volumn 57, Issue 2, 2010, Pages 349-380

  Anderson, E ^a   Hall, J ^b   Hartline, J ^c   Hobbes, M ^d   Karlin, A ^b   Saia, J ^e   Swaminathan, R ^a   Wilkes, J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b University of Washington   (United States)

^c Northwestern University   (United States)

^d DEAKIN UNIVERSITY   (Australia)

^e University of New Mexico   (United States)

Author keywords

Approximation algorithms; Data migration; Edge coloring; Load balancing; Space constraints

Indexed keywords

DATA MIGRATION; DATA OBJECTS; EDGE COLORING; LOAD-BALANCING; POLYNOMIAL-TIME ALGORITHMS; SPACE CONSTRAINTS; TEMPORARY STORAGE; THEORETICAL BOUNDS; THEORETICAL RESULT; USAGE PATTERNS;

NETWORK MANAGEMENT; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77949269636     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9214-y     Document Type: Article

References (22)

1. Anderson, E., Hall, J., Hartline, J., Hobbes, M., Karlin, A., Saia, J., Swaminithan, R., Wilkes, J.: An experimental study of data migration algorithms. In: Proceedings of the Workshop on Algorithm Engineering (WAE), pp. 145-158 (2001)
2. Anderson, E., Hobbs, M., Keeton, K., Spence, S., Uysal, M., Veitch, A.: Hippodrome: running circles around storage administration. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pp. 175-188 (2002)
3. Borowsky, E., Golding, R., Merchant, A., Schreier, L., Shriver, E., Spasojevic, M., Wilkes, J.: Using attribute-managed storage to achieve QoS. In: Proceedings of the International Workshop on Quality of Service (IWQoS), pp. 199-202. Columbia University, New York, June 1997
4. E. Coffman M. Garey D. Johnson A. Lapaugh 1985 Scheduling file transfers SIAM J. Comput. 14 3 744 780 0604.68039 10.1137/0214054 795943
5. B. Gavish O. Sheng 1990 Dynamic file migration in distributed computer systems Commun. ACM 33 2 177 189 10.1145/75577.75583 (Pubitemid 20657224)
6. Golubchik, I., Khuller, S., Khanna, S., Thurimella, R., Zhu, A.: Approximation algorithms for data placement on parallel disks. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 223-232 (2000)
7. L. Golubchik S. Khuller Y. Kim S. Shargorodskaya Y. Wan 2006 Data migration on parallel disks Algorithmica 45 1 137 158 1117.68091 10.1007/s00453-005-1194-6 2220939
8. M. Grammatikakis D. Hsu M. Kraetzl J. Sibeyn 1998 Packet routing in fixed-connection networks: A survey J. Parallel Distrib. Process. 54 2 77 132 0911.68018
9. Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 620-629 (2001)
10. Kashyap, S., Khuller, S., Wan, Y., Golubehik, L.: Fast reconfiguration of data placement in parallel disks. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 95-107 (2006) (Pubitemid 43774924)
11. S. Khuller Y. Kim Y. Wan 2004 Algorithms for data migration with cloning SIAM J. Comput. 33 2 448 461 1101.68984 10.1137/S009753970342585X 2048451
12. Khuller, S., Kim, Y., Malekian, A.: Improved algorithms for data migration. In: Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 164-175 (2006)
13. Kim, Y.: Data migration to minimize the average completion time. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 97-98 (2003)
14. Y. Kim 2005 Data migration to minimize the average completion time J. Algorithms 55 1 42 57 1066.90032 10.1016/j.jalgor.2004.07.009 2132027 (Pubitemid 40357144)
15. M. Kubale 1996 Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors Eur. J. Oper. Res. 94 2 242 251 0949.68507 10.1016/0377-2217(96)00131-2 (Pubitemid 126385631)
16. Micali, S., Vazirani, V.: An o(|V||e|) algorithm for finding a maximum matching in general graphs. In: Proceedings of the Symposium on Foundations of Computer Science (FOCS), pp. 17-27 (1980)
17. T. Nishizeki K. Kashiwagi 1990 On the 1.1 edge-coloring of multigraphs SIAM J. Discrete Math. 3 3 391 410 0702.05036 10.1137/0403035 1061980
18. Sanders, P., Solis-Oba, R.: How helpers hasten h-relations. In: Proceedings of the European Symposium on Algorithms (ESA), pp. 392-402 (2000)
19. C. Shannon 1949 A theorem on colouring lines of a network J. Math. Phys. 28 148 151 0032.43203 30203
20. Transaction Processing Performance Council. TPC Benchmark D (Decision Support) Standard Specification Revision 2.1. Transaction Processing Performance Council (1996)
21. V. Vizing 1964 On an estimate of the chromatic class of a p-graph Discrete Anal. 3 23 30 180505 (in Russian)
22. Wolf, J.: The placement optimization problem: a practical solution to the disk file assignment problem. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 1-10 (1989)