Abstract
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, where vertices represent the storage devices, and edges represent data transfers required between pairs of devices. Each vertex has a non-negative weight, and each edge has a processing time. A vertex completes when all the edges incident on it complete; the constraint is that two edges incident on the same vertex cannot be processed simultaneously. The objective is to minimize the sum of weighted completion times of all vertices. Kim (J. Algorithms 55, 42–57, 2005) gave an LP-rounding 3-approximation algorithm when edges have unit processing times. We give a more efficient primal-dual algorithm that achieves the same approximation guarantee. When edges have arbitrary processing times we give a primal-dual 5.83-approximation algorithm. We also study a variant of the open shop scheduling problem. This is a special case of the data migration problem in which the transfer graph is bipartite and the objective is to minimize the sum of completion times of edges. We present a simple algorithm that achieves an approximation ratio of \(\sqrt{2}\approx1.414\) , thus improving the 1.796-approximation given by Gandhi et al. (ACM Trans. Algorithms 2(1), 116–129, 2006). We show that the analysis of our algorithm is almost tight.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
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: Proc. of the Workshop on Algorithm Engineering, pp. 145–158 (2001)
Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183–202 (1998)
Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling problems for minsum criteria. In: Proc. of the 23rd International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 1009, pp. 646–657. Springer, New York (1996)
Coffman, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14(3), 744–780 (1985)
Gabow, H., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11(1) (February 1982)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved bounds for scheduling conflicting jobs with minsum criteria. In: Proc. of the Second Workshop on Approximation and Online Algorithms, pp. 68–82 (2004)
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Improved results for data migration and openshop scheduling. ACM Trans. Algorithms 2(1), 116–129 (2006)
Graham, R.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)
Hall, L., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22, 513–544 (1997)
Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On algorithms for efficient data migration. In: Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 620–629 (2001)
Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Sum coloring interval graphs and k-claw free graphs with applications for scheduling dependent jobs. Algorithmica 37, 187–209 (2003)
Hoogeveen, H., Schuurman, P., Woeginger, G.: Non-approximability results for scheduling problems with minsum criteria. In: Proc. of the 6th International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computing Science, vol. 1412, pp. 353–366. Springer, New York (1998)
Khuller, S., Kim, Y., Wan, Y.C.: Algorithms for data migration with cloning. SIAM J. Comput. 33(2), 448461 (2004)
Khuller, S., Malekian, A., Kim, Y.: Improved algorithms for data migration. In: Proc. of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 164–175 (2006)
Kim, Y.: Data migration to minimize the average completion time. J. Algorithms 55, 42–57 (2005)
Marx, D.: Complexity results for minimum sum edge coloring. Manuscript (2004)
Mestre, J.: Adaptive local ratio. In: Proc. of the 19th ACM-SIAM Symposium on Discrete Algorithms (2007)
Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM J. Discrete Math. 3(3), 391–410 (1990)
Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Program. 58, 263–285 (1993)
Queyranne, M., Sviridenko, M.: A (2+ε)-approximation algorithm for generalized preemptive open shop problem with minsum objective. J. Algorithms 45, 202–212 (2002)
Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. J. Sched. 5, 287–305 (2002)
Schulz, A.S.: Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: Proc. of the 5th International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computing Science, vol. 1084, pp. 301–315. Springer, New York (1996)
Wolsey, L.: Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge, 1985
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of the paper appeared in the Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006.
Research of R. Gandhi partially supported by Rutgers University Research Council Grant.
Research of J. Mestre done at the University of Maryland; supported by NSF Awards CCR-0113192 and CCF-0430650, and the University of Maryland Dean’s Dissertation Fellowship.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Gandhi, R., Mestre, J. Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. Algorithmica 54, 54–71 (2009). https://doi.org/10.1007/s00453-007-9118-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-007-9118-2