Mutual exclusion (mutex) is one of the most fundamental synchronization problems
encountered in shared memory systems. It appears in all computer science first-degree …

Process anonymity has been studied for a long time. Memory anonymity is more recent. In
an anonymous memory system, there is no a priori agreement among the processes on the …

Assuming that there is an a priori agreement between processes on the names of shared
memory locations, as is done in almost all the publications on concurrent shared memory …

Similarly to the injunction “Know yourself” engraved on the frontispiece of Delphi's temple
more than two millennia ago, the sentence “Make it as simple as possible, but not …

Process anonymity has been studied for a long time. Memory anonymity is more recent. In
an anonymous memory system, there is no a priori agreement among the processes on the …

The study of particular synchronization problems in anonymous shared-memory models--be
it processor anonymity, memory anonymity, or full anonymity--has produced ad hoc, so …

An anonymous shared memory REG can be seen as an array of atomic registers such that
there is no a priori agreement among the processes on the names of the registers. As an …

Anonymous shared memory systems, recently introduced in [36], are composed of objects
for which there is no a priori agreement between processes on their names. We resolve the …

This article addresses election in fully anonymous systems made up of n asynchronous
processes that communicate through atomic read-write registers or atomic read-modify-write …

The Distributed Computing Column Page 1 The Distributed Computing Column Seth Gilbert
National University of Singapore seth.gilbert@comp.nus.edu.sg In this issue of the distributed …