Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)

The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as its basic distributed data structure, viz. a path reversal transformation in rooted n-node trees; besides, it was also the first one to achieve a logarithmic average-case message complexity. The present paper proposes a direct and general approach to compute the moments of the cost of path reversal. It basically uses one-one correspondences between combinatorial structures and the associated probability generating functions: the expected cost of path

• Type: Conference
• Year: 1992
• Where: CONPAR
• Authors: Christian Lavault
• Keywords: CONPAR 1992, Distributed And Parallel Computing, Logarithmic Average-case Message, Path Reversal, Path Reversal Transformation