On the weakest failure detector for atomic multicast
Pierre Sutra
05 November 2019, 10:30 Salle/Bat : 465/PCRI-N
Contact :
Activités de recherche : Distributed algorithms
Résumé :
Atomic broadcast is a group communication primitive to order messages across a set of distributed processes. This primitive is used as a basic building block of many key online services today. Atomic multicast is its natural generalization where each message is addressed to a subset of the system nodes. This talk studies genuine solutions to this problem where only the sender and destinations of a message may take computation steps to deliver it. We show that the weakest failure detector to solve atomic multicast depends on the topology of the destination groups and present several possible candidates.
