Delimiting the power of bounded size synchronization objects (extended abstract)
Yehuda Afek, Gideon Stupp · 1994
Theoretically, various shared synchronization objects, such as compare&swap and arbitrary read-modify-write registers, are universal [10, 20].That is, any sequentially specified task can be solved in a concurrent system that supports these objects and a large enough number of shared read/write registers.Are these objects indeed almighty?Or, are there other considerations that have