Abstract
In this paper we study the problem of asynchronous processors traversing a list with path compression. We show that if an atomic splice operation is available, the worst-case work forp processors traversing a list of length h is Θ(np 1/2). The splice operation can be generalized to removek elements from the list. For thek-splice operation the worst-case work is Θ(np 1/ k+1).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model.Proceedings of the Second Annual Symposium on Parallel Algorithms and Architectures, pages 340–349, 1990.
R. J. Anderson and H. S. Woll. Wait-free parallel algorithms for the union-find problem.Proceedings of the 23rd ACM Symposium on Theory of Computation, pages 370–380, 1991.
B. N. Bershad. Practical considerations for lock-free concurrent objects. Technical Report CMU-CS-91-183, School of Computer Science, Carnegie Mellon University, September 1991.
M. Herlihy. A methodology for implementing highly concurrent data structures.Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 197–206, 1990.
M. Herlihy. Wait-free synchronization.ACM Transactions on Programming Languages and Systems, 13(1):124–149, 1991.
R. E. Tarjan. Efficiency of a good but not linear set union algorithm.Journal of the ACM, 22(4):215–225, 1975.
R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms.Journal of the ACM, 31(2):245–281, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Anderson, R.J. Primitives for asynchronous list compression. Math. Systems Theory 27, 453–470 (1994). https://doi.org/10.1007/BF01184934
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01184934