Publication

Making Consensus Practical

Rachid Guerraoui, Romain Boichat
2000
Reports

Abstract

This paper presents the abstraction of lazy consensus and argues for its use as an effective component for building distributed agreement protocols in practical asynchronous systems where processes and links can crash and recover. Lazy consensus looks like consensus, is equivalent to consensus, but is not consensus. The specification of lazy consensus has an on-demand and a re-entrant flavors that makes its use very efficient, especially in terms of forced logs, which are known to be major sources of overhead in distributed systems. We illustrate the use of lazy consensus as a building block to develop efficient atomic broadcast and atomic commitment protocols: two central abstractions in our DACE middleware environment.

Official source

https://infoscience.epfl.ch/entities/publication/2ef2f50f-666f-4f85-9532-8d19d8136c0b

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Rachid Guerraoui, Romain Boichat
2000
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/2ef2f50f-666f-4f85-9532-8d19d8136c0b

About this result

Related concepts (27)

Consensus (computer science)

A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. This often requires coordinating processes to reach consensus, or agree on some data value that is needed during computation. Example applications of consensus include agreeing on what transactions to commit to a database in which order, state machine replication, and atomic broadcasts.

Distributed computing

A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. Distributed computing is a field of computer science that studies distributed systems. The components of a distributed system interact with one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack of a global clock, and managing the independent failure of components.

Distributed operating system

A distributed operating system is system software over a collection of independent software, networked, communicating, and physically separate computational nodes. They handle jobs which are serviced by multiple CPUs. Each individual node holds a specific software subset of the global aggregate operating system. Each subset is a composite of two distinct service provisioners. The first is a ubiquitous minimal kernel, or microkernel, that directly controls that node's hardware.

Related publications (12)

Making Consensus Practical

Chat with Graph Search

Pricing Routes: Compensation of Crowd-Drivers

The Disclosure Power of Shared Objects

Demand-Side Flexibility for Energy Transitions: Policy Recommendations for Developing Demand Response