Section outline

  • Wait-free simulations of arbitrary shared objects, example of a FIFO queue, the strong compare & swap primitive, the wait-free hierarchy, universality, a non-blocking universal construction using compare & swap, a non-blocking universal construction using consensus objects, a wait-free universal construction using consensus objects, bounding the memory requirements, handling non-determinism, employing randomized consensus