A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
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
On chromatic sums and distributed resource allocation
Information and Computation
Minimum color sum of bipartite graphs
Journal of Algorithms
Improving a family of approximation algorithms to edge color multigraphs
Information Processing Letters
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for the Chromatic Sum
Proceedings of the The First Great Lakes Computer Science Conference on Computing in the 90's
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
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
Network-aware migration control and scheduling of differentiated virtual machine workloads
CLOUD '09 Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Efficient and scalable data evolution with column oriented databases
Proceedings of the 14th International Conference on Extending Database Technology
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
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
| Hi-index | 0.00 |
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.