Algorithms for and against the Cloud Roger Wattenhofer ETH Zurich β Distributed Computing Group
Disclaimer SenSys OSDI HotNets AAAI PODC Mobicom STOC FOCS SIGCOMM ICALP SPAA SODA EC
Algorithms for the Cloud
Algorithms for the Cloud Infrast frastru ructure cture
Algorithms for the Cloud just perfe fect ct
Algorithms for the Cloud Infrast frastru ructure cture
Find balanced separator of minimum size πΏ .
Find balanced separator of minimum size πΏ .
Find balanced separator of minimum size πΏ .
Find balanced separator of minimum size πΏ . Our result: almost linear time algorithm for small πΏ . [Brandt, W., 2017]
Find balanced separator of minimum size πΏ . Our result: almost linear time algorithm for small πΏ . β¦in a boring way [Brandt, W., 2017]
Algorithms for the Cloud just perfe fect ct
GPS for the Cloud
Just record 1ms of raw data
Coarse Time Navigation Exhaustive Search in Area
Also Robust to GPS Spoofing
Algorithms for the Cloud just perfe fect ct
$100B Revenue ΒΎ Online
Online Two Player Games Match Players Fast Waiting is Boooooring Match Players Well Similar Rating, Location, etc.
Min-Cost Perfect Matching With Delays (MPMD)
MPMD Example rating (space) time
MPMD Example rating (space) time
MPMD Example rating (space) time
MPMD Example rating (space) time
MPMD Example rating (space) space cost time cost time
MPMD Example rating (space) space cost time cost time
MPMD Example rating (space) space cost time cost time
MPMD Example rating (space) space cost time cost time
Haste Makes Waste!
MPMD Example rating (space) space cost time cost time
MPMD Example rating (space) time
MPMD Example rating (space) time
MPMD Example rating (space) algorithm cost optimal cost time
[Wang et al., 2018] β¦
The π(log π) Algorithm
Approximate Metric by Tree Height = π(logπ) E[ Distortion] = π(logπ) π₯ Leaves = Nodes in Metric Space [Fakcharoenphol, Rao, Talwar 2004], [Bansal, Buchbinder, Gupta, Naor 2015]
Algorithm
Algorithm
Algorithm = π₯
Algorithm
Algorithm
Algorithm
Algorithm
Algorithm
Algorithm
Algorithm
Proof
Proof
Proof
Proof Total space cost = Ο
Proof
Proof
Proof For each pair at least one timer running Total time cost β€ 2 Ο
Total Algorithm Cost = π(Ο )
What about OPT?
Proof
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT or ALG time OPT
Proof ALG time OPT or ALG time OPT cost = cost
Done?
Just One Little Thingβ¦
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
Proof ALG time OPT
OPT has an easy timeβ¦
β¦ but only every other phase!
Total OPT Cost = π»(Ο )
Where is the log π coming from? Height = π(logπ) for time E[ Distortion] = π(log π) for space
Algorithms against the Cloud
2008
Blockchain
Blockchain Basics
Transaction
Transaction
Transaction
Transaction
Block
Blockchain
Blockchain is Replicated
Blockchain Distributed Systems & Cryptography (1982) (1976)
Blockchain Distributed Systems & Cryptography Fault-Tolerance & Digital Signatures
Rule of Thumb Blockchains* may disrupt your business if you use signatures. *or blockchain-like tech
Recommend
More recommend