Robust data sharing with key-value stores
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Consistency and fault tolerance for erasure-coded distributed storage systems
Proceedings of the fifth international workshop on Data-Intensive Distributed Computing Date
Transparently increasing RMI fault tolerance
ACM SIGAPP Applied Computing Review
Asynchrony and collusion in the n-party BAR transfer problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Exclusive Access to Resources in Distributed Shared Memory Architecture
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Abstracting context in event-based software
Transactions on Aspect-Oriented Software Development IX
OSIRIS-SR: a scalable yet reliable distributed workflow execution engine
Proceedings of the 2nd ACM SIGMOD Workshop on Scalable Workflow Execution Engines and Technologies
Hi-index | 0.00 |
In modern computing a program is usually distributed among several processes. The fundamental challenge when developing reliable and secure distributed programs is to support the cooperation of processes required to execute a common task, even when some of these processes fail. Failures may range from crashes to adversarial attacks by malicious processes.Cachin, Guerraoui, and Rodrigues present an introductory description of fundamental distributed programming abstractions together with algorithms to implement them in distributed systems, where processes are subject to crashes and malicious attacks. The authors follow an incremental approach by first introducing basic abstractions in simple distributed environments, before moving to more sophisticated abstractions and more challenging environments. Each core chapter is devoted to one topic, covering reliable broadcast, shared memory, consensus, and extensions of consensus. For every topic, many exercises and their solutions enhance the understanding This book represents the second edition of "Introduction to Reliable Distributed Programming". Its scope has been extended to include security against malicious actions by non-cooperating processes. This important domain has become widely known under the name "Byzantine fault-tolerance".