Skip to Main content Skip to Navigation

The Universe of Symmetry Breaking Tasks

Abstract : Processes in a concurrent system need to coordinate using a shared memory or a message-passing subsystem in order to solve agreement tasks such as, for example, consensus or set agreement. However, often coordination is needed to “break the symmetry” of processes that are initially in the same state, for example, to get exclusive access to a shared resource, to get distinct names or to elect a leader. This paper introduces and studies the family of generalized symmetry breaking (GSB) tasks, that includes election, renaming and many other symmetry breaking tasks. Differently from agreement tasks, a GSB task is “inputless”, in the sense that processes do not propose values; the task specifies only the symmetry breaking requirement, independently of the system's initial state (where processes differ only on their identifiers). Among many various characterizing the family of GSB tasks, it is shown that (non adaptive) perfect renaming is universal for all GSB tasks.
Document type :
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Friday, January 28, 2011 - 1:42:44 PM
Last modification on : Thursday, January 20, 2022 - 4:19:59 PM
Long-term archiving on: : Friday, April 29, 2011 - 3:03:45 AM


Files produced by the author(s)


  • HAL Id : inria-00560453, version 1


Damien Imbs, Sergio Rajsbaum, Michel Raynal. The Universe of Symmetry Breaking Tasks. [Research Report] PI-1965, 2011, pp.16. ⟨inria-00560453⟩



Record views


Files downloads