Tag: #concurrency

Lamport timestamps measure time and causality in distributed systems. Timestamps are assigned to events, with the property that if event A happened-before event B, then A’s timestamp is less than B’s. 2017-02-12

Processes and messages can be unified - processes are just very slow messages, and message passing can be seen as splitting and fusing atoms. 2017-02-11

The happened-before relation models time in distributed systems, where events at different locations may not have a total order. It defines time using causality. 2017-02-10

Golang’s garbage collector uses a “tricolor” algorithm, dividing heap objects into black, white, and grey sets. The algorithm can run concurrently with the program, and the “tricolor” invariant ensures no pointers go directly from the black set to the white set, allowing the white set to be cleared. 2016-11-11