for and against
play

for and against the Cloud Roger Wattenhofer ETH Zurich Distributed - PowerPoint PPT Presentation

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


  1. Algorithms for and against the Cloud Roger Wattenhofer ETH Zurich – Distributed Computing Group

  2. Disclaimer SenSys OSDI HotNets AAAI PODC Mobicom STOC FOCS SIGCOMM ICALP SPAA SODA EC

  3. Algorithms for the Cloud

  4. Algorithms for the Cloud Infrast frastru ructure cture

  5. Algorithms for the Cloud just perfe fect ct

  6. Algorithms for the Cloud Infrast frastru ructure cture

  7. Find balanced separator of minimum size 𝐿 .

  8. Find balanced separator of minimum size 𝐿 .

  9. Find balanced separator of minimum size 𝐿 .

  10. Find balanced separator of minimum size 𝐿 . Our result: almost linear time algorithm for small 𝐿 . [Brandt, W., 2017]

  11. Find balanced separator of minimum size 𝐿 . Our result: almost linear time algorithm for small 𝐿 . …in a boring way [Brandt, W., 2017]

  12. Algorithms for the Cloud just perfe fect ct

  13. GPS for the Cloud

  14. Just record 1ms of raw data

  15. Coarse Time Navigation Exhaustive Search in Area

  16. Also Robust to GPS Spoofing

  17. Algorithms for the Cloud just perfe fect ct

  18. $100B Revenue ΒΎ Online

  19. Online Two Player Games Match Players Fast Waiting is Boooooring Match Players Well Similar Rating, Location, etc.

  20. Min-Cost Perfect Matching With Delays (MPMD)

  21. MPMD Example rating (space) time

  22. MPMD Example rating (space) time

  23. MPMD Example rating (space) time

  24. MPMD Example rating (space) time

  25. MPMD Example rating (space) space cost time cost time

  26. MPMD Example rating (space) space cost time cost time

  27. MPMD Example rating (space) space cost time cost time

  28. MPMD Example rating (space) space cost time cost time

  29. Haste Makes Waste!

  30. MPMD Example rating (space) space cost time cost time

  31. MPMD Example rating (space) time

  32. MPMD Example rating (space) time

  33. MPMD Example rating (space) algorithm cost optimal cost time

  34. [Wang et al., 2018] …

  35. The 𝑃(log π‘œ) Algorithm

  36. Approximate Metric by Tree Height = 𝑃(logπ‘œ) E[ Distortion] = 𝑃(logπ‘œ) π‘₯ Leaves = Nodes in Metric Space [Fakcharoenphol, Rao, Talwar 2004], [Bansal, Buchbinder, Gupta, Naor 2015]

  37. Algorithm

  38. Algorithm

  39. Algorithm = π‘₯

  40. Algorithm

  41. Algorithm

  42. Algorithm

  43. Algorithm

  44. Algorithm

  45. Algorithm

  46. Algorithm

  47. Proof

  48. Proof

  49. Proof

  50. Proof Total space cost = Οƒ

  51. Proof

  52. Proof

  53. Proof For each pair at least one timer running Total time cost ≀ 2 Οƒ

  54. Total Algorithm Cost = 𝑃(Οƒ )

  55. What about OPT?

  56. Proof

  57. Proof ALG time OPT

  58. Proof ALG time OPT

  59. Proof ALG time OPT

  60. Proof ALG time OPT or ALG time OPT

  61. Proof ALG time OPT or ALG time OPT cost = cost

  62. Done?

  63. Just One Little Thing…

  64. Proof ALG time OPT

  65. Proof ALG time OPT

  66. Proof ALG time OPT

  67. Proof ALG time OPT

  68. Proof ALG time OPT

  69. Proof ALG time OPT

  70. Proof ALG time OPT

  71. Proof ALG time OPT

  72. Proof ALG time OPT

  73. OPT has an easy time…

  74. … but only every other phase!

  75. Total OPT Cost = 𝛻(Οƒ )

  76. Where is the log π‘œ coming from? Height = 𝑃(logπ‘œ) for time E[ Distortion] = 𝑃(log π‘œ) for space

  77. Algorithms against the Cloud

  78. 2008

  79. Blockchain

  80. Blockchain Basics

  81. Transaction

  82. Transaction

  83. Transaction

  84. Transaction

  85. Block

  86. Blockchain

  87. Blockchain is Replicated

  88. Blockchain Distributed Systems & Cryptography (1982) (1976)

  89. Blockchain Distributed Systems & Cryptography Fault-Tolerance & Digital Signatures

  90. Rule of Thumb Blockchains* may disrupt your business if you use signatures. *or blockchain-like tech

Recommend


More recommend