Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Combinatorial optimization
On chromatic sums and distributed resource allocation
Information and Computation
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Algorithms for Data Migration with Cloning
SIAM Journal on Computing
Stochastic Machine Scheduling with Precedence Constraints
SIAM Journal on Computing
An asymptotic approximation scheme for multigraph edge coloring
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Data migration to minimize the total completion time
Journal of Algorithms
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Return of the boss problem: competing online against a non-adaptive adversary
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
SIAM Journal on Computing
On a local protocol for concurrent file transfers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Minimal cost reconfiguration of data placement in storage area network
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Combinatorial algorithms for data migration to minimize average completion time
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Minimal cost reconfiguration of data placement in a storage area network
Theoretical Computer Science
Corrigendum: Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
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 is modeled by a transfer graph, where vertices represent the storage devices, and the edges indicate the data transfers required between pairs of devices. Each vertex has a nonnegative weight, and each edge has a release time and 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 (Journal of Algorithms, 55:42--57, 2005) gave a 9-approximation algorithm for the problem when edges have arbitrary processing times and are released at time zero. We improve Kim's result by giving a 5.06-approximation algorithm. We also address the open shop scheduling problem, O|rj| ∑wjCj, and show that it is a special case of the data migration problem. Queyranne and Sviridenko (Journal of Scheduling, 5:287-305, 2002) gave a 5.83-approximation algorithm for the nonpreemptive 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.