Title: LR-algorithm: concurrent operations on priority queues
Abstract: The heap representation of priority queues is one of the most widely used methods. However, the conventional implementation tends to be inadequate for parallel applications. The paper proposes a new method, the LA-algorithm, which allows concurrent insertions on priority queues. In contrast to the conventional heap implementation, the LR-algorithm directs any two consecutive insertion requests to two different subtrees and thus provides a possibility to perform these insertions in parallel. The LR algorithm was implemented on a Sequent Symmetry shared memory multiprocessor. The obtained performance figures indicate that the algorithm is a promising approach.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Publication Year: 2002
Publication Date: 2002-12-04
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 28
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot