(Almost) All Objects Are Universal in Message Passing Systems

d Abstract) Carole Delporte-Gallet1 , Hugues Fauconnier2 , and Rachid Guerraoui3 1 ESIEE-IGM Marne-La-Vallee, France 2 LIAFA Univ Paris VII, France 3 EPFL Lausanne, Switzerland This paper shows that all shared atomic object types that can solve consensus among k > 1 processes have the same weakest failure detector in a message passing system with process crash failures. In such a system, object types such as test-and-set, fetch-and-add, and queue, known to have weak synchronization power in a shared memory system are thus, in a precise sense, equivalent to universal types like compareand-swap, known to have the strongest synchronization power. In the particular case of a message passing system of two processes, we show that, interestingly, even a register is in that sense universal.

• Type: Conference
• Year: 2005
• Where: WDAG
• Authors: Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
• Keywords: Algorithms, Message Passing, Object Types, Synchronization Power, WDAG 2005