Just Join for Parallel Ordered Sets
Author:
Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA, USA
2. Karlsruhe Institute of Technology, Karlsruhe, Germany
Funder
The Intel Science and Technology Center
NSF
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/2935764.2935768
Reference30 articles.
1. S. Adams. Efficient sets--a balancing act. Journal of functional programming 3(04):553--561 1993. S. Adams. Efficient sets--a balancing act. Journal of functional programming 3(04):553--561 1993.
2. An algorithm for the organization of information;Adelson-Velsky G.;Proc. of the USSR Academy of Sciences,1962
3. Y. Akhremtsev and P. Sanders. Fast parallel operations on search trees. arXiv preprint arXiv:1510.05433 2015. Y. Akhremtsev and P. Sanders. Fast parallel operations on search trees. arXiv preprint arXiv:1510.05433 2015.
4. Symmetric binary B-Trees: Data structure and maintenance algorithms
5. G. Blelloch D. Ferizovic and Y. Sun. Parallel ordered sets using join. arXiv preprint arXiv:1602.02120 2016. G. Blelloch D. Ferizovic and Y. Sun. Parallel ordered sets using join. arXiv preprint arXiv:1602.02120 2016.
Cited by 27 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Functional Essence of Imperative Binary Search Trees;Proceedings of the ACM on Programming Languages;2024-06-20
2. Teaching Parallel Algorithms Using the Binary-Forking Model;2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27
3. CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20
4. Analyzing the Performance: B-trees vs. Red-Black Trees with Caching Strategies;Communications in Computer and Information Science;2024
5. Effective Verifiable Index Structure for High Contention Workload;2023 4th International Conference on Computer Engineering and Application (ICCEA);2023-04-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3