S-Paxos: Offloading the Leader for High Throughput State Machine Replication

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.

The field of distributed computing has a long history, of more than fifty years. During that time, our understanding of the field has improved immensely and a certain body of folklore beliefs has formed. However, such folklore beliefs are not necessarily a ...

In order to effectively utilize results from quasi-static cyclic testing on structural components for the earthquake-induced collapse risk quantification of structures, the need exists to establish collapse-consistent loading protocols representing the asy ...

We consider the problem of making apps fault-tolerant through replication, when apps operate at the microsecond scale, as in finance, embedded computing, and microservices apps. These apps need a replication scheme that also operates at the microsecond sca ...

This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional ...

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

Modern online services are shifting away from monolithic applications to loosely-coupled microservices because of their improved scalability, reliability, programmability and development velocity. Microservices communicating over the datacenter network req ...

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component ...

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

S-Paxos: Offloading the Leader for High Throughput State Machine Replication

Chat with Graph Search

The Hidden Complexity of Distributed Systems

Development of collapse-consistent loading protocols for experimental testing of steel columns

Microsecond Consensus for Microsecond Applications

Adaptation and Learning Over Networks Under Subspace Constraints-Part I: Stability Analysis

Distributed Computing with Modern Shared Memory

Optimus Prime: Accelerating Data Transformation in Servers

Genuinely Distributed Byzantine Machine Learning

System Support for Efficient Replication in Distributed Systems

Speculative Linearizability