Data migration to minimize the total completion time

Journal of Algorithms

Volumn 55, Issue 1, 2005, Pages 42-57

  Kim, Yoo Ah ^a  

^a University of Maryland ^*  (United States)

Author keywords

Approximation algorithms; Data migration; Linear programming; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; LINEAR PROGRAMMING; PROBLEM SOLVING; SCHEDULING; SERVERS;

APPROXIMATION ALGORITHMS; DATA ACCESS PATTERNS; DATA MIGRATION; JOB COMPLETION;

DATA REDUCTION;

EID: 14844356052     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.07.009     Document Type: Article

References (24)

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 2001 145 158
2. A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai, and T. Tamir On chromatic sums and distributed resource allocation Inform. Comput. 140 1998 183 202
3. A. Bar-Noy, M.M. Halldórsson, and G. Korsarz Tight bound for the sum of a greedy coloring Inform. Process. Lett. 71 1999 135 140
4. A. Bar-Noy, M.M. Halldórsson, G. Korsarz, H. Shachnai, and R. Salman Sum multi-coloring of graphs J. Algorithms 37 2 2000 422 450
5. A. Bar-Noy, and G. Kortsarz The minimum color-sum of bipartite graphs J. Algorithms 28 1998 339 365
6. A. Caprara, and R. Rizzi Improving a family of approximation algorithms to edge color multi-graphs Inform. Process. Lett. 68 1998 11 15
7. E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. Lapaugh Scheduling file transfers SIAM J. Comput. 14 3 1985 744 780
8. R. Gandhi, M. Halldorsson, G. Kortsarz, and H. Shachnai Improved results for data migration and open-shop scheduling The 31st International Colloquium on Automata, Languages and Programming (ICALP) 2004
9. R. Gandhi, M. Halldorsson, G. Kortsarz, and H. Shachnai Improved bounds for sum multicoloring and weighted completion time of dependent jobs Proc. of the Second Workshop on Approximation and Online Algorithms (WAOA) Sept. 2004
10. M.K. Goldberg Edge-coloring of multi-graphs: recoloring technique J. Graph Theory 8 1984 121 137
11. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, and A. Zhu Approximation algorithms for data placement on parallel disks Proc. of the 11th Symposium on Discrete Algorithms 2000 223 232
12. J. Hall, J. Hartline, A. Karlin, J. Saia, and J. Wilkes On algorithms for efficient data migration Proc. of the 12th Symposium on Discrete Algorithms 2001 620 629
13. L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein Scheduling to minimize average completion time: off-line and on-line algorithms Math. Oper. Res. 22 1997 513 544
14. M.M. Halldórsson, G. Kortsarz, and H. Shachani Minimizing average completion of dedicated tasks and partially ordered sets 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 2001 114 126
15. D.S. Hochbaum, T. Nishizeki, and D.B. Shmoys A better than "Best Possible" algorithm to edge color multi-graphs J. Algorithms 7 1986 79 104
16. I. Holyer The NP-completeness of edge-coloring SIAM J. Comput. 10 4 1981 718 720
17. S. Kashyap, and S. Khuller Algorithms for non-uniform size data placement on parallel disks Foundations of Software Technology and Theoretical Computer Science 2003
18. E. Kubicka, G. Kubicki, and D. Kountanis Approximation algorithms for the chromatic sum Proceedings of the First Great Lakes Computer Science Conference Lecture Notes in Comput. Sci. vol. 1203 1989 Springer-Verlag Berlin 15 21
19. S. Nicoloso, M. Sarrafzadeh, and X. Song On the sum coloring problem on interval graphs Algorithmica 23 1999 109 126
20. T. Nishizeki, and K. Kashiwagi On the 1.1 edge-coloring of multi-graphs SIAM J. Discrete Math. 3 3 1990 391 410
21. H. Shachnai, and T. Tamir On two class-constrained versions of the multiple knapsack problem Algorithmica 29 2001 442 467
22. H. Shachnai, and T. Tamir Polynomial time approximation schemes for class-constrained packing problems Proc. of Workshop on Approximation Algorithms 2000 238 249
23. V.G. Vizing On an estimate of the chromatic class of a p-graph Diskret. Analiz. 3 1964 25 30 (in Russian)
24. M. Queyranne Structure of a simple scheduling polyhedron Math. Programming 58 1993 263 285