@article{283703fa4f284ecf89558cdd4b747bf1,

title = "A robust randomized algorithm to perform independent tasks",

abstract = "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 ṡ frac(log2 p, log log p)) expected work and O ((frac(p, p - f))3.4 W) expected communication, for an arbitrary number f < p of crashes.",

keywords = "Crash failure, Distributed algorithm, Message passing, Ramanujan graphs, Randomization, Scheduling tasks",

author = "Chlebus, {Bogdan S.} and Leszek Ga̧sieniec and Kowalski, {Dariusz R.} and Shvartsman, {Alex A.}",

year = "2008",

month = "12",

day = "1",

doi = "10.1016/j.jda.2008.03.001",

language = "English (US)",

volume = "6",

pages = "651--665",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "4",

}