Talks SPTDC 2019
Leslie Lamport
MicrosoftThe Paxos algorithm or how to win a Turing Award (part 1)
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 (part 1)
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
Ittai Abraham
VMwareByzantine fault-tolerance, state machine replication and blockchains (part 1)
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
Michael Scott
University of Rochester
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
Eliezer Gafni
UCLAThe coordination power of distributed computing models (part 2)
Description will be announced soon
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 (part 1)
These lectures describe how blockchain-based ledgers require rethinking the foundations of classical distributed computing.
Read more
Trevor Brown
University of WaterlooPractical aspects of multicore programming (part 1)
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
Eliezer Gafni
UCLAThe coordination power of distributed computing models (part 1)
Description will be announced soon
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 more
Danny Hendler
Ben-Gurion University of the NegevRecoverable algorithms for non-volatile memory (part 1)
Danny 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
Danny Hendler
Ben-Gurion University of the NegevRecoverable algorithms for non-volatile memory (part 2)
Danny 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: technical tools (part 2)
Description will be announced soon
Read more
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 more
Petr Kuznetsov
Professor, Telecom Paris, Institut Polytechnique ParisLower bounds in distributed computing: technical tools (part 1)
Description will be announced soon
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