Главная
Study mode:
on
1
Intro
2
WHY DO WE NEED IT?
3
YOU CAN'T TELL THE DIFFERENCE
4
FALLACIES
5
A MODEL FOR DISTRIBUTED COMPUTATION
6
LAMBDA CALCULUS ALONZO CHURCH 1930
7
VON NEUMANN MACHINE JOHN VON NEUMANN 1945
8
ACTORS CARL HEWITT 1973
9
IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
10
LINEARIZABILITY
11
DISSECTING CAP
12
LAMPORT CLOCKS
13
VECTOR CLOCKS
14
FAILURE DETECTION FORMAL MODEL
15
ACCRUAL FAILURE DETECTOR HAYASHIBARA ET AL. 2004
16
SWIM FAILURE DETECTOR
17
SPECIFICATION
18
CONSENSUS ALGORITHMS
19
NODE RING & EPIDEMIC GOSSIP
20
Akka CLUSTER EXTENSIONS
21
CLUSTER MEMBERSHIP IN AKKA
22
GOSSIPING
23
LEADER
24
NETWORK PARTITIONS
25
AKKA MODULES FOR DISTRIBUTION
26
AKKA & THE ROAD AHEAD
27
REFERENCES
Description:
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.

The Road to Akka Cluster, and Beyond

Strange Loop Conference
Add to list
00:00
-03:14