A Contention-Friendly Binary Search Tree-Reference-Cited by-同舟云学术

A Contention-Friendly Binary Search Tree

Published:2013 Issue: Volume: Page:229-240
ISSN:0302-9743
Container-title:Euro-Par 2013 Parallel Processing
language:
Short-container-title:

Author:

Crain Tyler,Gramoli Vincent,Raynal Michel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40047-6_25

Reference26 articles.

1. Mao, Y., Kohler, E., Morris, R.T.: Cache craftiness for fast multicore key-value storage. In: EuroSys., pp. 183–196 (2012)

2. Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: PPoPP, pp. 161–170 (2012)

3. Adelson-Velskii, G., Landis, E.M.: An algorithm for the organization of information. In: Proc. of the USSR Academy of Sciences, vol. 146, pp. 263–266 (1962)

4. Bayer, R.: Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 1(4), 290–306 (1972)

5. Bougé, L., Gabarro, J., Messeguer, X., Schabanel, N.: Height-relaxed AVL rebalancing: A unified, fine-grained approach to concurrent dictionaries. Technical Report RR1998-18, ENS Lyon (1998)

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compiler‐driven approach for automating nonblocking synchronization in concurrent data abstractions;Concurrency and Computation: Practice and Experience;2023-10-24

2. A concurrent program logic with a future and history;Proceedings of the ACM on Programming Languages;2022-10-31

3. Jiffy;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28

4. Bundling linked data structures for linearizable range queries;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28

5. PPBT: A High Performance Parallel Search Tree;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12