Algorithms

• Designing A Distributed Bloom Filter With Counting And Scalable Extensions For Membership Tests · 2019-07-14

  A comprehensive technical exploration of designing a distributed bloom filter with counting and scalable extensions for membership tests, covering key concepts, practical implementations, and real-world applications.

• Sublinear Algorithms: Property Testing, Query Complexity, and the Power of Random Sampling · 2019-07-07

  An exploration of sublinear-time algorithms—property testing, the regularity lemma connection, and how random sampling reveals global structure without reading the whole input.

• The Implementation Of A Log Structured Merge Tree (Lsm Tree) With Level Based Compaction In Rocksdb · 2019-07-02

  A comprehensive technical exploration of the implementation of a log structured merge tree (lsm tree) with level based compaction in rocksdb, covering key concepts, practical implementations, and real-world applications.

• Implementing A Distributed Priority Queue With Request Batching And Hierarchical Aggregation · 2019-06-27

  A comprehensive technical exploration of implementing a distributed priority queue with request batching and hierarchical aggregation, covering key concepts, practical implementations, and real-world applications.

• Streaming Algorithms: Misra-Gries, Count-Min Sketch, AMS, and the Power of Small Space · 2019-06-27

  A comprehensive tour of streaming algorithms—from frequency estimation sketches to frequency moments—and the space lower bounds that define what's possible.

• Analyzing The Correctness Of Clock Synchronization Protocols: Ntp, Ptp, And Hybrid Logical Clocks · 2019-06-26

  A comprehensive technical exploration of analyzing the correctness of clock synchronization protocols: ntp, ptp, and hybrid logical clocks, covering key concepts, practical implementations, and real-world applications.

• Building A Partition Aware Transactional Database Using Calvin: Deterministic Ordering And Lock Free Execution · 2019-06-25

  A comprehensive technical exploration of building a partition aware transactional database using calvin: deterministic ordering and lock free execution, covering key concepts, practical implementations, and real-world applications.

• The Performance Of Distributed Query Processing With Join Aggregate Trees In Google Spanner · 2019-06-16

  A comprehensive technical exploration of the performance of distributed query processing with join aggregate trees in google spanner, covering key concepts, practical implementations, and real-world applications.

• A Deep Dive Into Apache Cassandra’S Snitch And Replication Strategy: Endpoint Aware Distribution · 2019-06-11

  A comprehensive technical exploration of a deep dive into apache cassandra’s snitch and replication strategy: endpoint aware distribution, covering key concepts, practical implementations, and real-world applications.

• Implementing A Distributed Snapshot Algorithm For Global State Collection In Asynchronous Systems · 2019-06-01

  A comprehensive technical exploration of implementing a distributed snapshot algorithm for global state collection in asynchronous systems, covering key concepts, practical implementations, and real-world applications.

• Designing A Consistent Hashing With Bounded Loads Using Google’S Consistent Hashing With Sparse Representation · 2019-05-23

  A comprehensive technical exploration of designing a consistent hashing with bounded loads using google’s consistent hashing with sparse representation, covering key concepts, practical implementations, and real-world applications.

• The Microbenchmarking Of Rpc Frameworks: Grpc, Thrift, And Zeromq In High Latency Environments · 2019-05-20

  A comprehensive technical exploration of the microbenchmarking of rpc frameworks: grpc, thrift, and zeromq in high latency environments, covering key concepts, practical implementations, and real-world applications.

• Building A Distributed File System Inspired By Gfs: Master Architecture, Chunk Replication, And Leases · 2019-05-14

  A comprehensive technical exploration of building a distributed file system inspired by gfs: master architecture, chunk replication, and leases, covering key concepts, practical implementations, and real-world applications.

• Online Algorithms: Competitive Analysis, Ski Rental, Paging, and the Primal-Dual Method · 2019-05-12

  A thorough examination of online algorithms—decisions without foresight—through the lens of competitive analysis, from ski rental and paging to the k-server problem.

• Parameterized Complexity: FPT, the W-Hierarchy, Kernelization, and Bounded Search Trees · 2019-05-11

  An in-depth exploration of parameterized complexity theory—how structural parameters beyond input size can tame NP-hardness through FPT algorithms, kernelization, and the W-hierarchy.

• NP-Completeness: The Cook-Levin Theorem, Polynomial Reductions, and the Hardest Problems in NP · 2019-05-03

  A deep dive into the theory of NP-completeness—from Turing machines and the Cook-Levin theorem to the taxonomy of NP-complete problems and the P versus NP question.

• Linear Programming: Simplex Geometry, Duality, and the Interior-Point Revolution · 2019-04-19

  An exploration of linear programming from Dantzig's simplex method through von Neumann's duality to Karmarkar's interior-point breakthrough that reshaped optimization theory.

• Comparing Gossip Protocols For Failure Detection: Swim, Lifeguard, And Hybrid Approaches · 2019-04-15

  A comprehensive technical exploration of comparing gossip protocols for failure detection: swim, lifeguard, and hybrid approaches, covering key concepts, practical implementations, and real-world applications.

• Network Flow: From Ford-Fulkerson to Push-Relabel and the Max-Flow Min-Cut Theorem · 2019-04-13

  A rigorous journey through the algorithms that solve maximum flow—Ford-Fulkerson, Edmonds-Karp, Dinic, and Push-Relabel—together with the duality that binds flows to cuts.

• Implementing A Distributed Transactional Key Value Store With Optimistic Concurrency Control · 2019-04-10

  A comprehensive technical exploration of implementing a distributed transactional key value store with optimistic concurrency control, covering key concepts, practical implementations, and real-world applications.

• A Rigorous Proof Of The Cap Theorem And Its Implications For Distributed Database Design · 2019-04-09

  A comprehensive technical exploration of a rigorous proof of the cap theorem and its implications for distributed database design, covering key concepts, practical implementations, and real-world applications.

• The Design And Implementation Of A Distributed Rate Limiter Using Token Buckets And Gossip Protocols · 2019-04-09

  A comprehensive technical exploration of the design and implementation of a distributed rate limiter using token buckets and gossip protocols, covering key concepts, practical implementations, and real-world applications.

• Building A Linearizability Tester For Distributed Systems: Monotonic Reads And Writes In Jetpack · 2019-04-01

  A comprehensive technical exploration of building a linearizability tester for distributed systems: monotonic reads and writes in jetpack, covering key concepts, practical implementations, and real-world applications.

• Analyzing The Performance Of Two Phase Commit (2Pc) And Three Phase Commit (3Pc) In Geo Distributed Systems · 2019-03-27

  A comprehensive technical exploration of analyzing the performance of two phase commit (2pc) and three phase commit (3pc) in geo distributed systems, covering key concepts, practical implementations, and real-world applications.