Parallel heap: An optimal parallel priority queue-Reference-Cited by-同舟云学术

Parallel heap: An optimal parallel priority queue

Published:1992-03 Issue:1 Volume:6 Page:87-98
ISSN:0920-8542
Container-title:The Journal of Supercomputing
language:en
Short-container-title:J Supercomput

Author:

Deo Narsingh,Prasad Sushil

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00128644.pdf

Reference28 articles.

1. Akl, S.G. 1984. An optimal algorithm for parallel selection. Inf. Proc. Letters, 19, 1 (July):47?50.

2. Bilardi, G., and Nicolau, A. 1989. Adaptive bitonic sorting: An optimal algorithm for shared-memory machines. SIAM J. Computing, 18, 2 (Apr.):216?228.

3. Biswas, J., and Browne, J.C. 1987. Simultaneous update of priority structures. In Proc., 1987 Internat. Conf. on Parallel Processing (Aug.), IEEE Comp. Soc. Press, Silver Spring, Md., pp. 124?131.

4. Ultracomputer Note #97;R. Cole,1986

5. Cole, R. 1988. Parallel merge sort. SIAM J. Computing, 17, 4 (Aug.):770?785.

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

1. BGPQ: A Heap-Based Priority Queue Design for GPUs;50th International Conference on Parallel Processing;2021-08-09

2. Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

3. TSLQueue: An Efficient Lock-Free Design for Priority Queues;Euro-Par 2021: Parallel Processing;2021

4. A Survey on Agent-based Simulation Using Hardware Accelerators;ACM Computing Surveys;2019-02-27

5. Implementation and Analysis of Distributed Relaxed Concurrent Queues in Remote Memory Access Model;Procedia Computer Science;2019