Concurrent access of priority queues

DOI10.1109/12.9744zbMath0663.68043OpenAlexW2139241970MaRDI QIDQ3814801

V. Nageshwara Rao, Vipin Kumar

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/da0950e13a5b4fa99b5af9da040d5c5cc2bbb7af

zbMATH Keywords

parallel algorithmspriority queuesspeedupconcurrent data structuresdeletionsinsertionsbranch-and- boundshared-memory multiprocessor

Mathematics Subject Classification ID

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

Related Items

An efficient algorithm for concurrent priority queue heaps, AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗, Amortization results for chromatic search trees, with an application to priority queues, Architecture independent parallel selection with applications to parallel priority queues, Parallel priority queues, Parallel algorithms for priority queue operations, A multiple-heaps algorithm for parallel simulation of collision systems, Parallel algorithms for priority queue operations, Parallel heap: an optimal parallel priority queue, Amortization results for chromatic search trees, with an application to priority queues, P-tree structures and event horizon: efficient event-set implementations, Parallel state-space search for a first solution with consistent linear speedups