Parallel priority queues based on binomial heaps

DOI10.1016/S0167-8191(00)00064-8MaRDI QIDQ1583321zbMATH OpenOpenAlexFDO

Authors Sajal K. Das, Maria Cristina Pinotti

Publication date 26 October 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00064-8

zbMATH Keywords

time complexitybinomial heapscarry adderinsert and delete operationsmeldable priority queuesparallel data structures

Mathematics Subject Classification ID

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

Recommendations

• Parallel heap: an optimal parallel priority queue
• Priority queues on parallel machines
• Parallel priority queues
• Fast meldable priority queues
• Parallel algorithms for priority queue operations

Cited in

(8)

• scientific article; zbMATH DE number 4007418 (Why is no real title available?)
• A comparative study of parallel and sequential priority queue algorithms
• Fast meldable priority queues
• Parallel algorithms for priority queue operations
• Parallel heap: an optimal parallel priority queue
• A parallel priority queue with constant time operations
• Randomized priority queues for fast parallel access
• Priority queues on parallel machines

This page was built for publication: Parallel priority queues based on binomial heaps

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