Explore the landscape of distributed computing in this 44-minute conference talk from Strange Loop. Journey through the evolution of computer architecture and distributed systems, examining key concepts like Impossibility Theorems, Consensus Protocols, and Failure Detection. Discover the theoretical foundations and design decisions behind Akka Cluster, and gain insights into the future of distributed computing. Learn about ACID 2.0, Disorderly Programming, and other cutting-edge research in the field. Delve into topics such as Lambda Calculus, Von Neumann Machine, Actors model, CAP theorem, Lamport Clocks, and various failure detection mechanisms. Understand the challenges and importance of writing distributed applications in today's technological landscape, featuring mobile devices, NoSQL databases, and cloud services.
Overview
Syllabus
Intro
WHY DO WE NEED IT?
YOU CAN'T TELL THE DIFFERENCE
FALLACIES
A MODEL FOR DISTRIBUTED COMPUTATION
LAMBDA CALCULUS ALONZO CHURCH 1930
VON NEUMANN MACHINE JOHN VON NEUMANN 1945
ACTORS CARL HEWITT 1973
IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
LINEARIZABILITY
DISSECTING CAP
LAMPORT CLOCKS
VECTOR CLOCKS
FAILURE DETECTION FORMAL MODEL
ACCRUAL FAILURE DETECTOR HAYASHIBARA ET AL. 2004
SWIM FAILURE DETECTOR
SPECIFICATION
CONSENSUS ALGORITHMS
NODE RING & EPIDEMIC GOSSIP
Akka CLUSTER EXTENSIONS
CLUSTER MEMBERSHIP IN AKKA
GOSSIPING
LEADER
NETWORK PARTITIONS
AKKA MODULES FOR DISTRIBUTION
AKKA & THE ROAD AHEAD
REFERENCES
Taught by
Strange Loop Conference
