Some Novel Computational Models to Think About
summary
Surveys practical computation models and gives concrete payoffs: algorithms for frequency moments reach surprising low-space single-pass bounds while matching multiparty communication lower bounds; MapReduce and simple filtering primitives enable scalable inverted indexes and billion‑edge graph tasks with near‑linear speedups in practice; semi‑streaming captures single‑pass graph algorithms like connected components with polylog memory per machine; and the parameter server design actually runs large‑scale deep learning across many machines and delivers usable convergence and wall‑clock speedups.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:58Frequency Moments
- 4:32Data Stream
- 6:19Communication Complexity
- 8:00MapReduce
- 10:32Simple MapReduce
- 13:24Summary
- 15:00Comments
- 16:45Semistreaming
- 19:51MapReduce Filters
- 22:36Parameters Server
- 25:29Millville
- 26:13Connected Components
- 27:19The Message
- 29:01Questions
related talks
30mThree Goals in Parallel Graph Computations: High Performance, High Productivity, and Reduced Comm...
16mPreview: Cloud Computing
53mMapReduce Algorithmics
28mCommunication Avoiding Algorithms for Linear Algebra and Beyond
01h 20mAn Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
50mBig Data on Smallish Machines
39mSketching and Randomization for Distributed Submodular and Coverage Optimization
43mKeynote: Tiny Data Collectors, Vastly (...) & the Land of Tiny Challenges
