A comparative study of parallel and sequential priority queue algorithms

DOI10.1145/249204.249205MaRDI QIDQ4369947zbMATH OpenOpenAlexFDO

Authors Robert Rönngren, Rassul Ayani

Publication date 1 April 1998

Published in ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6176, http://www.acm.org/pubs/contents/journals/tomacs/

zbMATH Keywords

priority queues

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel algorithms for priority queue operations
• Parallel algorithms for priority queue operations
• Parallel priority queues
• Priority queues on parallel machines
• Priority queues on parallel machines
• Parallel priority queues based on binomial heaps
• Parallel heap: an optimal parallel priority queue
• A pathwise comparison of parallel queues

Cited in

(9)

• SOFTWARE DIVERSITY-BASED ACTIVE REPLICATION AS AN APPROACH FOR ENHANCING THE PERFORMANCE OF ADVANCED SIMULATION SYSTEMS
• Intermediate value linearizability: a quantitative correctness criterion
• A Back-to-Basics Empirical Study of Priority Queues
• scientific article; zbMATH DE number 2188502 (Why is no real title available?)
• Revisiting priority queues for image analysis
• A formalization of image vectorization by region merging
• Quality of services for remote control in high energy physics experiments: A case study
• scientific article; zbMATH DE number 3992907 (Why is no real title available?)
• TSLQueue: an efficient lock-free design for priority queues

This page was built for publication: A comparative study of parallel and sequential priority queue algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369947)