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. We consider this problem with the objective of minimizing the sum of completion times of all storage devices. Kim [13] gave a 9-approximation algorithm for the problem. We improve Kim’s result by giving a 5.06-approximation algorithm.
We also address the open shop scheduling problem, O|r j | ∑ w j C j , and show that it is a special case of the data migration problem. Queyranne and Sviridenko [18] gave a 5.83-approximation algorithm for the non-preemptive version of the open shop problem. They state as an obvious open question whether there exists an algorithm for open shop scheduling that gives a performance guarantee better than 5.83. Our 5.06 algorithm for data migration proves the existence of such an algorithm. Crucial to our improved result is a property of the linear programming relaxation for the problem. Similar linear programs have been used for various other scheduling problems. Our technique may be useful in obtaining improved results for these problems as well.
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.
References
Anderson, E., Hall, J., Hartline, J., Hobbes, M., et al.: An Experimental Study of Data Migration Algorithms. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol. 2141, pp. 145–158. Springer, Heidelberg (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)
Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. Wiley, Chichester (1998)
Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved Scheduling Problems For Minsum Criteria. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 646–657. Springer, Heidelberg (1996)
Coffman, E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling File Transfers. SIAM Journal on Computing 14(3), 744–780 (1985)
Graham, R.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)
Gabow, H., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM Journal of Computing 11(1) (February 1992)
Hall, J., Hartline, J., Karlin, A., Saia, J., Wilkes, J.: On Algorithms for Efficient Data Migration. In: 12th SODA, pp. 620–629 (2001)
Hall, L., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Mathematics of Operations Research 22, 513–544 (1997)
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: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 353–366. Springer, Heidelberg (1998)
Khuller, S., Kim, Y., Wan, Y.C.: Algorithms for Data Migration with Cloning. In: 22nd PODS, pp. 27–36 (2003)
Kim, Y.: Data Migration to Minimize the Average Completion Time. In: 14th SODA, pp. 97–98 (2003)
Lawler, E.L., Lenstra, J.K., Rinnooy-Kan, A.H.G., Shmoys, D.B.: Sequencing and Scheduling: Algorithms and Complexity. In: Graves, S.C., et al. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522 (1993)
Nishizeki, T., Kashiwagi, K.: On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics 3(3), 391–410 (1990)
Queyranne, M.: Structure of a Simple Scheduling Polyhedron. Mathematical Programming 58, 263–285 (1993)
Queyranne, M., Sviridenko, M.: A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective. Journal of Algorithms 45, 202–212 (2002)
Queyranne, M., Sviridenko, M.: Approximation Algorithms for Shop Scheduling Problems with Minsum Objective. Journal of Scheduling 5, 287–305 (2002)
Schulz, A.S.: Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 301–315. Springer, Heidelberg (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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gandhi, R., Halldórsson, M.M., Kortsarz, G., Shachnai, H. (2004). Improved Results for Data Migration and Open Shop Scheduling. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive