article

Data migration to minimize the total completion time

Author:

Yoo-Ah KimAuthors Info & Claims

Journal of Algorithms, Volume 55, Issue 1

Pages 42 - 57

https://doi.org/10.1016/j.jalgor.2004.07.009

Published: 01 April 2005 Publication History

Abstract

We consider the data migration problem, which is the problem of finding an efficient schedule to migrate data in a network. The data layout of a large storage server needs to be computed based on the expected data access pattern for load balancing. As the data access pattern changes over time, we need to recompute a new layout and then migrate the data from its current layout to the new layout. Our objective is to minimize the total completion time over all storage devices. We develop a 3-approximation algorithm when each migration job needs the same amount of time and a 9- approximation when the times required for different migration jobs are different. Another interesting objective is to minimize the total completion time over all data migration jobs. We present a 10- approximation algorithm when each migration job has a different processing time. We extend our results to the resource constrained scheduling problem where each job requires at most m resources. We obtain O(m)-approximations for both resource and job completion times.

References

[1]

{1} E. Anderson, J. Hall, J. Hartline, M. Hobbes, A. Karlin, J. Saia, R. Swaminathan, J. Wilkes, An experimental study of data migration algorithms, Workshop on Algorithm Engineering (2001) 145-158.]]

Digital Library

[2]

{2} A. Bar-Noy, M. Bellare, M.M. Halldórsson, H. Shachnai, T. Tamir, On chromatic sums and distributed resource allocation, Inform. Comput. 140 (1998) 183-202.]]

Digital Library

[3]

{3} A. Bar-Noy, M.M. Halldórsson, G. Korsarz, Tight bound for the sum of a greedy coloring, Inform. Process. Lett. 71 (1999) 135-140.]]

[4]

{4} A. Bar-Noy, M.M. Halldórsson, G. Korsarz, H. Shachnai, R. Salman, Sum multi-coloring of graphs, J. Algorithms 37 (2) (2000) 422-450.]]

Digital Library

[5]

{5} A. Bar-Noy, G. Kortsarz, The minimum color-sum of bipartite graphs, J. Algorithms 28 (1998) 339-365.]]

Digital Library

[6]

{6} A. Caprara, R. Rizzi, Improving a family of approximation algorithms to edge color multi-graphs, Inform. Process. Lett. 68 (1998) 11-15.]]

Digital Library

[7]

{7} E.G. Coffman, M.R. Garey, D.S. Johnson, A.S. Lapaugh, Scheduling file transfers, SIAM J. Comput. 14 (3) (1985) 744-780.]]

[8]

{8} R. Gandhi, M. Halldorsson, G. Kortsarz, H. Shachnai, Improved results for data migration and open-shop scheduling, in: The 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.]]

[9]

{9} R. Gandhi, M. Halldorsson, G. Kortsarz, H. Shachnai, Improved bounds for sum multicoloring and weighted completion time of dependent jobs, in: Proc. of the Second Workshop on Approximation and Online Algorithms (WAOA), Sept. 2004.]]

[10]

{10} M.K. Goldberg, Edge-coloring of multi-graphs: recoloring technique, J. Graph Theory 8 (1984) 121-137.]]

[11]

{11} L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, A. Zhu, Approximation algorithms for data placement on parallel disks, in: Proc. of the 11th Symposium on Discrete Algorithms, 2000, pp. 223-232.]]

Digital Library

[12]

{12} J. Hall, J. Hartline, A. Karlin, J. Saia, J. Wilkes, On algorithms for efficient data migration, in: Proc. of the 12th Symposium on Discrete Algorithms, 2001, pp. 620-629.]]

Digital Library

[13]

{13} L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling to minimize average completion time: off-line and on-line algorithms, Math. Oper. Res. 22 (1997) 513-544.]]

Digital Library

[14]

{14} M.M. Halldórsson, G. Kortsarz, H. Shachani, Minimizing average completion of dedicated tasks and partially ordered sets, in: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, 2001, pp. 114-126.]]

Digital Library

[15]

{15} D.S. Hochbaum, T. Nishizeki, D.B. Shmoys, A better than "Best Possible" algorithm to edge color multigraphs, J. Algorithms 7 (1986) 79-104.]]

Digital Library

[16]

{16} I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10 (4) (1981) 718-720.]]

Digital Library

[17]

{17} S. Kashyap, S. Khuller, Algorithms for non-uniform size data placement on parallel disks, in: Foundations of Software Technology and Theoretical Computer Science, 2003.]]

[18]

{18} E. Kubicka, G. Kubicki, D. Kountanis, Approximation algorithms for the chromatic sum, in: Proceedings of the First Great Lakes Computer Science Conference, in: Lecture Notes in Comput. Sci., vol. 1203, Springer-Verlag, Berlin, 1989, pp. 15-21.]]

Digital Library

[19]

{19} S. Nicoloso, M. Sarrafzadeh, X. Song, On the sum coloring problem on interval graphs, Algorithmica 23 (1999) 109-126.]]

[20]

{20} T. Nishizeki, K. Kashiwagi, On the 1.1 edge-coloring of multi-graphs, SIAM J. Discrete Math. 3 (3) (1990) 391-410.]]

Digital Library

[21]

{21} H. Shachnai, T. Tamir, On two class-constrained versions of the multiple knapsack problem, Algorithmica 29 (2001) 442-467.]]

Digital Library

[22]

{22} H. Shachnai, T. Tamir, Polynomial time approximation schemes for class-constrained packing problems, in: Proc. of Workshop on Approximation Algorithms, 2000, pp. 238-249.]]

Digital Library

[23]

{23} V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3 (1964) 25-30 (in Russian).]]

[24]

{24} M. Queyranne, Structure of a simple scheduling polyhedron, Math. Programming 58 (1993) 263-285.]]

Digital Library

Cited By

Shafiee MGhaderi J(2018)An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in DatacentersIEEE/ACM Transactions on Networking10.1109/TNET.2018.284585226:4(1674-1687)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2845852
Herrmann JBosilca GHérault TMarchal LRobert YDongarra J(2016)Assessing the cost of redistribution followed by a computational kernelParallel Computing10.1016/j.parco.2015.09.00552:C(22-41)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.parco.2015.09.005
Hajiaghayi MKhandekar RKortsarz GLiaghat V(2014)On a Local Protocol for Concurrent File TransfersTheory of Computing Systems10.1007/s00224-013-9500-155:3(613-636)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s00224-013-9500-1
Show More Cited By

Index Terms

Recommendations

Improved results for data migration and open shop scheduling

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. It ...
Preemptive Weighted Completion Time Scheduling of Parallel Jobs

We present a new algorithm for the preemptive offline scheduling of independent jobs on a system consisting of m identical machines. The jobs can be parallel; that is, they may need the concurrent availability of several machines for their execution. To ...
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times

We consider a single machine scheduling problem with simple linear deterioration. Job processing times are assumed to be a simple linear function of a job-dependent growth rate and the job's starting time. We seek an optimal schedule, so as to minimize ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Algorithms

Journal of Algorithms Volume 55, Issue 1

April 2005

98 pages

ISSN:0196-6774

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 April 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Shafiee MGhaderi J(2018)An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in DatacentersIEEE/ACM Transactions on Networking10.1109/TNET.2018.284585226:4(1674-1687)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2845852
Herrmann JBosilca GHérault TMarchal LRobert YDongarra J(2016)Assessing the cost of redistribution followed by a computational kernelParallel Computing10.1016/j.parco.2015.09.00552:C(22-41)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1016/j.parco.2015.09.005
Hajiaghayi MKhandekar RKortsarz GLiaghat V(2014)On a Local Protocol for Concurrent File TransfersTheory of Computing Systems10.1007/s00224-013-9500-155:3(613-636)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1007/s00224-013-9500-1
Hajiaghayi MKhandekar RKortsarz GLiaghat VMeyer auf der Heide FRajaraman R(2011)On a local protocol for concurrent file transfersProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989538(269-278)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989538
Liu ZHe BHsiao HChen Y(2011)Efficient and scalable data evolution with column oriented databasesProceedings of the 14th International Conference on Extending Database Technology10.1145/1951365.1951380(105-116)Online publication date: 21-Mar-2011
https://dl.acm.org/doi/10.1145/1951365.1951380
Halldórsson MKortsarz GSviridenko M(2011)Sum edge coloring of multigraphs via configuration LPACM Transactions on Algorithms10.1145/1921659.19216687:2(1-21)Online publication date: 31-Mar-2011
https://dl.acm.org/doi/10.1145/1921659.1921668
Anderson EHall JHartline JHobbes MKarlin ASaia JSwaminathan RWilkes J(2010)Algorithms for Data MigrationAlgorithmica10.5555/3118232.311851757:2(349-380)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.5555/3118232.3118517
Stage ASetzer T(2009)Network-aware migration control and scheduling of differentiated virtual machine workloadsProceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing10.1109/CLOUD.2009.5071527(9-14)Online publication date: 23-May-2009
https://dl.acm.org/doi/10.1109/CLOUD.2009.5071527
Halldórsson MKortsarz GSviridenko M(2008)Min sum edge coloring in multigraphs via configuration LPProceedings of the 13th international conference on Integer programming and combinatorial optimization10.5555/1788814.1788847(359-373)Online publication date: 26-May-2008
https://dl.acm.org/doi/10.5555/1788814.1788847
Mestre JTeng S(2008)Adaptive local ratioProceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1347082.1347099(152-160)Online publication date: 20-Jan-2008
https://dl.acm.org/doi/10.5555/1347082.1347099
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents