A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th 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
An Experimental Study of Data Migration Algorithms
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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 results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Graph Theory
Min sum edge coloring in multigraphs via configuration LP
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Hi-index | 0.01 |
We study a very natural local protocol for a file transfer problem. Consider a scenario where several files, which may have varied sizes and get created over a period of time, are to be transferred between pairs of hosts in a distributed environment. Our protocol assumes that while executing the file transfers, an individual host does not use any global knowledge; and simply subdivides its I/O resources equally among all the active file transfers at that host at any point in time. This protocol is motivated by its simplicity of use and its applications to scheduling map-reduce workloads. Here we study the problem of deciding the start times of individual file transfers to optimize QoS metrics like average completion time or MakeSpan. To begin with, we show that these problems are NP-hard. We next argue that the ability of scheduling multiple concurrent file transfers at a host makes our protocol stronger than previously studied protocols that schedule a sequence of matchings, in which no two active file transfers share a host at any time. We then generalize the approach of Queyranne and Sviridenko (J. Scheduling, 2002) and Gandhi et al. (ACM T. Algorithms, 2008) that relates the MakeSpan and completion time objectives and present constant factor approximation algorithms.