An asymptotic study for path reversal

Authors:
Alain Giorgetti
Affiliations:
Laboratoire d'Informatique de l'Université de Franche-Comté, 16 route de Gray, 25030 Besançon Cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 6
Cited 0

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
A tight amortized bound for path reversal

Information Processing Letters
A log (N) distributed mutual exclusion algorithm based on path reversal

Journal of Parallel and Distributed Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm

Proceedings of the 3rd International Workshop on Distributed Algorithms
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)

CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing

Quantified Score

Hi-index	5.23

Visualization

Abstract

A path reversal is performed in a rooted tree when a node becomes the root of all the nodes along the path from it to the former root. This algorithm on trees is presented as a transition system specified by induction over a convenient view of the tree structure. When each tree node is assigned a fixed weight representing its relative probability to move to the root, the transition system defines a finite Markov chain. This paper presents some of its asymptotic properties. A closed formula for the stationary distribution and a tight upper bound for the average computational complexity of path reversal are also given as new results.