Sciweavers

Share
JDA
2008

A robust randomized algorithm to perform independent tasks

9 years 8 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with processors communicating by message passing. Crashes are determined by a fully adaptive adversary that is restricted only by an upper bound f on the number of crashes. The complexity of algorithms is measured by work and communication, where work is defined as the number of available-processor steps, and communication as the number of point-to-point messages. We develop a randomized algorithm with W = O(t + p
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where JDA
Authors Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman
Comments (0)
books