Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference7 articles.
1. 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.
2. 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.
3. 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.
4. 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.
5. M. Herlihy. Wait-free synchronization.ACM Transactions on Programming Languages and Systems, 13(1):124?149, 1991.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献