SPSC revisited part III – FastFlow + Sparse Data
holy moly. This is some heavily-optimized mechanical-sympathy Java code. By using a sparse data structure, cache-aligned fields, and wait-free low-level CAS concurrency primitives via sun.misc.Unsafe, a single-producer/single-consumer queue implementation goes pretty damn fast compared to the current state of the art
(tags: nitsanw optimization concurrency java jvm cas spsc queues data-structures algorithms)
Non-blocking transactional atomicity
interesting new distributed atomic transaction algorithm from Peter Bailis
(tags: algorithms database distributed scalability storage peter-bailis distcomp)