This book presents several significant advances in algorithms
designed to solve the Do-All problem in distributed message-passing
settings under various models of adversity, including processor
crashes, asynchrony, message delays, network partitions, and
malicious processor behaviors. Upper and lower bounds are
presented, demonstrating the extent to which efficiency can be
combined with fault-tolerance. This book contains the recent
advances in the principles of efficient and fault-tolerant
cooperative computing, narrowing the gap between abstract models of
dependable network computing and realistic distributed systems.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!