Data migration to minimize the total completion time☆
References (24)
- et al.
On chromatic sums and distributed resource allocation
Inform. Comput.
(1998) - et al.
Tight bound for the sum of a greedy coloring
Inform. Process. Lett.
(1999) - et al.
Sum multi-coloring of graphs
J. Algorithms
(2000) - et al.
The minimum color-sum of bipartite graphs
J. Algorithms
(1998) - et al.
Improving a family of approximation algorithms to edge color multi-graphs
Inform. Process. Lett.
(1998) - et al.
A better than “Best Possible” algorithm to edge color multi-graphs
J. Algorithms
(1986) - et al.
An experimental study of data migration algorithms
Workshop on Algorithm Engineering
(2001) - et al.
Scheduling file transfers
SIAM J. Comput.
(1985) - et al.
Improved results for data migration and open-shop scheduling
- et al.
Improved bounds for sum multicoloring and weighted completion time of dependent jobs
Edge-coloring of multi-graphs: recoloring technique
J. Graph Theory
(1984)
Approximation algorithms for data placement on parallel disks
Cited by (24)
Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results
2016, Parallel ComputingCitation Excerpt :In this context, several variants of the one-port bidirectional model have been considered. The first variant is an unidirectional one-port model, where a processor can participate in only one communication at a time (either as a sender or as a receiver); with this variant, the redistribution problem becomes NP-complete [10]. A second variant consists of assuming that each processor p has a number of ports v(p) that represents the maximum number of simultaneous transfers that this processor can be involved in [11].
Research on the method of cross-cluster migration of bank's massive valuable data
2020, Proceedings - 2020 International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering, ICBAIE 2020An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
2018, IEEE/ACM Transactions on NetworkingFacility location models to locate data in information networks: a literature review
2016, Annals of Operations Research
- ☆
A preliminary version of this paper appeared at the 14th Annual Symposium on Discrete Algorithms, 2003. This research was supported by NSF Award CCR-0113192.
Copyright © 2004 Elsevier Inc. All rights reserved.