Theoretically-Efficient and Practical Parallel In-Place Radix Sorting-Reference-Cited by-同舟云学术

Theoretically-Efficient and Practical Parallel In-Place Radix Sorting

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Obeya Omar¹,Kahssay Endrias¹,Fan Edward¹,Shun Julian¹

Affiliation:

1. Massachusetts Institute of Technology, Cambridge, MA, USA

Funder

NSF CAREER Award

Applications Driving Architectures (ADA) Research Center, a JUMP Center co-sponsored by SRC and DARPA,

DOE Early Career Award

DARPA SDH

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3323165.3323198

Reference47 articles.

1. Improved Parallel Integer Sorting without Concurrent Writing

2. Improved deterministic parallel integer sorting

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

1. Parallel Integer Sort: Theory and Practice;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

2. Parallel Block-InsertionSort;2023 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON);2023-12-05

3. Efficient end-to-end long-read sequence mapping using minimap2-fpga integrated with hardware accelerated chaining;Scientific Reports;2023-11-17

4. Parallel Top-K Algorithms on GPU: A Comprehensive Study and New Methods;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11

5. High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17