On a scheduling problem where a job can be executed only by a limited number of processors
Computers and Operations Research
Parallel algorithms for maximum bipartite matchings and maximum 0-1 flows
Journal of Parallel and Distributed Computing
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Algorithms
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
| Hi-index | 0.00 |
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also n computational agents connected by an asynchronous ring. Each agent holds a subset of the items, where initially different agents might hold items associated to the same color. We analyze the problem of distributively assigning colors to agents in such a way that (a) each color is assigned to one agent and (b) the number of different colors assigned to each agent is minimum. Since any color assignment requires that the items be distributed according to it (e.g. all items of the same color are to be held by only one agent), we define the cost of a color assignment as the amount of items that need to be moved, given an initial allocation. We first show that any distributed algorithm for this problem on the ring requires a communication complexity of Ω(n ċ m) and then we exhibit a polynomial time distributed algorithm with message complexity matching the bound, that determines a color assignment with cost at most (2 + Ε) times the optimal cost, for any 0