We will describe emerging shared-memory models for recoverable objects, as well as algorithms for implementing recoverable versions of mutual-exclusion locks and lock-free concurrent objects.
Read more
A brief introduction to concurrent data structures, including what it means for concurrent data structures to be correct, and how they should be implemented to achieve high performance on real systems.
Read more
In the first part of this tutorial we will provide a new general framework that can be used to explain many consensus protocol variants, and in the second — touch upon the deep connections between Byzantine fault-tolerance and blockchains.
Read more
This course will briefly survey background material on hardware primitives and memory models, together with formal notions of safety, liveness, and proof techniques; explore nonblocking versions of important data structures; and introduce appropriate memory management techniques.
Read more
Discussion of problems of distributed computing and their solutions.
Read more
This course will briefly survey background material on hardware primitives and memory models, together with formal notions of safety, liveness, and proof techniques; explore nonblocking versions of important data structures; and introduce appropriate memory management techniques.
Read more
We discuss popular techniques designed for establishing (tight) lower bounds in distributed computing.
Read moreThe workshop is an opportunity for doctoral students and young researchers working in the area of distributed systems to present their work to our highly motivated and interested audience. You can use it to test your wild new ideas, discuss work in progress, or present your accomplishments (e.g., submitted or accepted conference papers, designed systems, etc.). We also provide space for posters in the coffee rooms.
Read more
In the first part of this tutorial we will provide a new general framework that can be used to explain many consensus protocol variants, and in the second — touch upon the deep connections between Byzantine fault-tolerance and blockchains.
Read more
These lectures describe how blockchain-based ledgers require rethinking the foundations of classical distributed computing.
Read more
How to think about concurrent systems mathematically is explained using the Paxos consensus algorithm as an example. First, the problem to be solved is precisely specified. Then, a "shared memory" voting algorithm is specified and shown to implement the problem specification. Finally, the Paxos algorithm is specified and shown to implement the voting algorithm. How mathematical thinking is used in industry is then briefly discussed.
Read more
This talk will discuss how to solve the consensus problem in the case where some processes of a distributed message-passing system may exhibit a Byzantine behavior.
Read more
These lectures describe how blockchain-based ledgers require rethinking the foundations of classical distributed computing.
Read more
We will describe emerging shared-memory models for recoverable objects, as well as algorithms for implementing recoverable versions of mutual-exclusion locks and lock-free concurrent objects.
Read more
How to think about concurrent systems mathematically is explained using the Paxos consensus algorithm as an example. First, the problem to be solved is precisely specified. Then, a "shared memory" voting algorithm is specified and shown to implement the problem specification. Finally, the Paxos algorithm is specified and shown to implement the voting algorithm. How mathematical thinking is used in industry is then briefly discussed.
Read more
This talk will discuss how to solve the consensus problem in the case where some processes of a distributed message-passing system may exhibit a Byzantine behavior.
Read more
A brief introduction to concurrent data structures, including what it means for concurrent data structures to be correct, and how they should be implemented to achieve high performance on real systems.
Read more
We discuss popular techniques designed for establishing (tight) lower bounds in distributed computing.
Read more