Performing work in broadcast networks

We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access channels. Stations are prone to crashes whose patterns of occurrence are specified by adversarial models. Work, defined as the number of the available processor steps, is the complexity measure. We consider only reliable algorithms that perform all the tasks as long as at least one station remains operational. It is shown that every reliable algorithm has to perform work (t + p t) even when no failures occur. An optimal deterministic algorithm for the channel with collision detection is developed, which performs work O(t + p t). Another algorithm, for the channel without collision detection, performs work O(t+p t+p

• Type: Journal
• Year: 2006
• Where: DC
• Authors: Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
• Keywords: Algorithm, Collision Detection, DC 2001, DC 2006, Reliable Algorithm