Theory

• The Proof Of Correctness Of The Treiber Stack And Its Aba Problem Mitigation Using Stam’S Schemes · 2019-09-26

  A comprehensive technical exploration of the proof of correctness of the treiber stack and its aba problem mitigation using stam’s schemes, covering key concepts, practical implementations, and real-world applications.

• Implementing A Efficient Read Copy Update (Rcu) Mechanism For Linux Kernel Modules · 2019-09-08

  A comprehensive technical exploration of implementing a efficient read copy update (rcu) mechanism for linux kernel modules, covering key concepts, practical implementations, and real-world applications.

• A Comparison Of Concurrent Hash Table Designs: Cuckoo Hashing, Hopscotch Hashing, And Striped Locking · 2019-09-06

  A comprehensive technical exploration of a comparison of concurrent hash table designs: cuckoo hashing, hopscotch hashing, and striped locking, covering key concepts, practical implementations, and real-world applications.

• Communication Complexity: Yao's Two-Party Model, the Rectangle Method, and Lower Bounds Galore · 2019-08-18

  A deep investigation of communication complexity—the mathematics of information exchange between parties—and its far-reaching implications for circuits, data structures, and streaming.

• Building A Lock Free Skip List For Range Queries In Distributed Memory · 2019-08-17

  A comprehensive technical exploration of building a lock free skip list for range queries in distributed memory, covering key concepts, practical implementations, and real-world applications.

• The Performance Impact Of Cache Line Padding In Concurrent Queues On Numa Architectures · 2019-08-16

  A comprehensive technical exploration of the performance impact of cache line padding in concurrent queues on numa architectures, covering key concepts, practical implementations, and real-world applications.

• An In Depth Look At Concurrent Data Structures: Elimination Backoff Stacks, Michael Scott Queues, And Hazard Pointers · 2019-08-04

  A comprehensive technical exploration of an in depth look at concurrent data structures: elimination backoff stacks, michael scott queues, and hazard pointers, covering key concepts, practical implementations, and real-world applications.

• Designing A Scalable Key Value Store With Lsm Trees And Write Amplification Analysis · 2019-08-02

  A comprehensive technical exploration of designing a scalable key value store with lsm trees and write amplification analysis, covering key concepts, practical implementations, and real-world applications.

• A Formal Verification Of Linearizability In A Lock Free Linked List Using Proper Testing · 2019-07-30

  A comprehensive technical exploration of a formal verification of linearizability in a lock free linked list using proper testing, covering key concepts, practical implementations, and real-world applications.

• Implementing A Wait Free Concurrent Hash Map In C++ For High Throughput Systems · 2019-07-30

  A comprehensive technical exploration of implementing a wait free concurrent hash map in c++ for high throughput systems, covering key concepts, practical implementations, and real-world applications.

• The Algorithmic Complexity Of Distributed Graph Algorithms: Bfs, Minimum Spanning Tree, And All Pairs Shortest Paths · 2019-07-24

  A comprehensive technical exploration of the algorithmic complexity of distributed graph algorithms: bfs, minimum spanning tree, and all pairs shortest paths, covering key concepts, practical implementations, and real-world applications.

• Building A Distributed Message Queue With Kafka: Partitioning, Replication, And Exactly Once Semantics · 2019-07-22

  A comprehensive technical exploration of building a distributed message queue with kafka: partitioning, replication, and exactly once semantics, covering key concepts, practical implementations, and real-world applications.

• A Thorough Explanation Of The Google File System’S Master Replication And Shadow Masters · 2019-07-16

  A comprehensive technical exploration of a thorough explanation of the google file system’s master replication and shadow masters, covering key concepts, practical implementations, and real-world applications.

• 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.