Abstract
This lecture introduced the notion of universality in distributed algorithms, illustrating it in the context of shared memory. The lecture gave a precise definition of a universal computing object and presented a simple universal construction based on a consensus object and register objects. The lecture also presented the generalization of this universality to the case of assembly consensus.
Here are the main topics covered during this lecture :
- " Universal object " ;
- " Universal construction
- " Generalized universality
