28. Each machine is responsible for a subset of the
records. Each record exists on only one
machine.!
1, 2, 3…
97, 98, 99…
765, 769…
169, 170…
Client
333, 334…
244, 245…
34. Memory is at least 100x faster than disk
ms
μs
ns
ps
1MB Disk/Network
1MB Main Memory
0.000,000,000,000
Cross Continental Main Memory
L1 Cache Ref
Round Trip
Ref
Cross Network L2 Cache Ref
Round Trip
* L1 ref is about 2 clock cycles or 0.7ns. This is
the time it takes light to travel 20cm
46. But at the cost of
loosing the single
address space
47. Traditional
Shared Shared
In Memory
Disk
Nothing
Distributed Simpler
In Memory
Contract
48. There are three key themes here:
Simplify the
Distribution
No Disk
contract
Improve
Gain
scalability by
scalability
picking All data is
through a
appropriate held in RAM
distributed
ACID
architecture
properties.
50. ODC – Distributed, Shared Nothing, In
Memory, Semi-Normalised, Graph DB
450 processes
2TB of RAM
Messaging (Topic Based) as a system of record
(persistence)
66. We need to optimise for our CPU architecture
ms
μs
ns
ps
1MB Disk/Network
1MB Main Memory
0.000,000,000,000
Cross Continental Main Memory
L1 Cache Ref
Round Trip
Ref
Cross Network L2 Cache Ref
Round Trip
* L1 ref is about 2 clock cycles or 0.7ns. This is
the time it takes light to travel 20cm
67. Tools like Vtune allow us to
optimise software to truly leverage
our hardware