Local Consistency Sandbox

Written Jun 28, 2021 - Projects

The weakest model of consistency for shared memory is local consistency, which requires only that a process observe its own operations in program order, and places no restrictions on how a process sees the operations performed by any other process.

Continue reading ↦

PRAM Consistency Sandbox

Written Jun 28, 2021 - Projects

A weaker model than causal consistency is PRAM Consistency. In order for a system to be PRAM consistent, each process must see its own operations in program order, and operations from a single source must be seen in the order they were issued.

Continue reading ↦

Causal Consistency Sandbox

Written Jun 28, 2021 - Projects

In a sequentially consistent distributed system, all processes observe all write operations in some common order. A causally consistent system has a slightly weaker guarantee - only causally related writes must be observed in a common order, and processes can disagree on the order of causally unrelated events.

Continue reading ↦

Sequential Consistency Sandbox

Written Jun 27, 2021 - Projects

A distributed system that meets the condition “the result of any execution is the same as if the operations of all processers were executed in some sequential order, and the operations of each individual process appear in this sequence in the order specified by its program” is said to be Sequentially consistent.

Continue reading ↦

Sorry I was alching

Written Jun 15, 2021 - Blog

Since I was a medium-sized child, I’ve enjoyed playing the MMO RuneScape. It is by far the game I’ve spent the most time playing, and, well, despite that, I’m not very far in the game at all. I started sometime in 2006 and, being that the internet hadn’t even been invented yet, I was constantly lost. Even though the game had only been around for ~5 years, it was still absolutely massive.

Continue reading ↦

Connect 4 - The Power (or, here, lack thereof) Two Choices

Written May 27, 2021 - Projects

A year or so ago, in my lab’s reading group we read the famous power of two choices in randomized load balancing paper, and it gave me an awful idea - what if we applied a similar idea to games? As a very quick explanation, for the task of load balancing requests - basically, you have a bunch of servers handling things for you like fetching emails, and you want to spread out the work evenly - a common approach is to just pick a random server and send the next request there.

Continue reading ↦