The do-all problem in broadcast networks

• Authors: Bogdan S. Chlebus;Dariusz R. Kowalski;Andrzej Lingas
• Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
• Year: 2001

The problem of performing t tasks in a distributed system on p failure-prone processors is one of the fundamental problems in distributed computing. If the tasks are similar and independent and the processors communicate by sending messages then the problem is called Do-All. In our work the communication is over a multiple-access channel, and the attached stations may fail by crashing. The measure of performance is work, defined as the number of the available processor steps. Algorithms are required to be reliable in that they perform all the tasks as long as at least one station remains operational. We show that each reliable algorithm always needs to perform at least the minimum amount &OHgr;(t + p√t) of work. We develop an optimal deterministic algorithm for the channel with collision detection performing only the minimum work &THgr;(t + p√t). Another algorithm is given for the channel without collision detection, it performs work O(t + p√t + p · min {f, t}), where f p is the number of failures. It is proved to be optimal if the number of faults is the only restriction on the adversary. Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. We develop a randomized algorithm which needs to perform only the expected minimum work if the adversary may fail a constant fraction of stations, but it has to select the failure-prone stations prior to the start of an algorithm.