Achour Mostefaoui
University of NantesByzantine agreement (part 2)
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 moreTalks SPTDC 2019
Danny Hendler
Ben-Gurion University of the NegevRecoverable algorithms for non-volatile memory (part 2)
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
Petr Kuznetsov
Professor, Telecom Paris, Institut Polytechnique ParisLower bounds in distributed computing (part 2)
We discuss popular techniques designed for establishing (tight) lower bounds in distributed computing.
Read more
Ittai Abraham
VMwareByzantine fault-tolerance, state machine replication and blockchains (part 2)
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 moreWorkshop
The 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
Eli Gafni
UCLAThe coordination power of distributed computing models
Discussion of problems of distributed computing and their solutions.
Read more
Trevor Brown
University of WaterlooPractical aspects of multicore programming
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
Leslie Lamport
MicrosoftThe Paxos algorithm or how to win a Turing Award (part 2)
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
Maurice Herlihy
Brown University Computer Science DeptBlockchain Topics: proof-of-work, smart contracts, and cross-chain swaps
These lectures describe how blockchain-based ledgers require rethinking the foundations of classical distributed computing.
Read more
Michael Scott
University of RochesterNonblocking data structures (part 2)
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
Eli Gafni
UCLA
Trevor Brown
University of WaterlooPractical aspects of multicore programming (part 2)
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
Ittai Abraham
VMwareByzantine fault-tolerance, state machine replication and blockchains
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
Leslie Lamport
MicrosoftThe Paxos algorithm or how to win a Turing Award
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
Achour Mostefaoui
University of NantesByzantine agreement
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
Michael Scott
University of RochesterNonblocking data structures
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
Petr Kuznetsov
Professor, Telecom Paris, Institut Polytechnique ParisLower bounds in distributed computing
We discuss popular techniques designed for establishing (tight) lower bounds in distributed computing.
Read more
Maurice Herlihy
Brown University Computer Science DeptBlockchain Topics: proof-of-work, smart contracts, and cross-chain swaps (part 2)
These lectures describe how blockchain-based ledgers require rethinking the foundations of classical distributed computing.
Read more
Danny Hendler
Ben-Gurion University of the NegevRecoverable algorithms for non-volatile memory
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