A Distributed Message-Optimal Assignment on Rings

TL;DR

This paper studies a distributed problem where agents on a ring must assign colors to minimize item movement, providing an optimal algorithm with near-minimal message complexity and discussing improvements for cost and complexity trade-offs.

Contribution

It introduces an optimal message complexity algorithm for color assignment on rings, achieving near-optimal cost and analyzing asynchronous solutions and trade-offs.

Findings

Message complexity lower bound of Ω(n·m) established.

Polynomial-time algorithm achieves at most three times the optimal cost.

Solutions for asynchronous settings and cost-time trade-offs are discussed.

Abstract

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 a ring. Each agent holds a subset of the items and items of the same color can be held by different agents. We analyze the problem of distributively assigning colors to agents in such a way that (a) each color is assigned to one agent only and (b) the number of different colors assigned to each agent is minimum. Since any color assignment requires 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 requires a message complexity of $\Omega(n\cdot m)$ and then we exhibit an optimal message complexity algorithm for synchronous rings that in polynomial time determines a color assignment with cost at most three times the optimal. We also discuss solutions for the asynchronous setting. Finally, we show how to get a better cost solution at the expenses of either the message or the time complexity.