QPID: A Distributed Priority Queue with Item Locality

@article{Bajpai2008QPIDAD,
  title={QPID: A Distributed Priority Queue with Item Locality},
  author={Ratan Bajpai and Krishna Kishore Dhara and Venkatesh Krishnaswamy},
  journal={2008 IEEE International Symposium on Parallel and Distributed Processing with Applications},
  year={2008},
  pages={215-223}
}
  • R. Bajpai, K. Dhara, V. Krishnaswamy
  • Published 10 December 2008
  • Computer Science
  • 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications
Distributed systems have evolved from highly regular systems to irregular systems that are not based on any specific architecture. Highly optimized distributed algorithms that are often variants of classic data structures have been developed for these systems. However, such approaches may not be effective for applications built on loosely coupled irregular distributed systems. In this paper, we look at distributed priority queues for such systems, where the locality of items cannot be altered… 
View on IEEE
doi.org
4 Citations
Background Citations
2
Methods Citations
1

Figures and Tables from this paper

4 Citations

A Scalable Relaxed Distributed Priority Queue
TLDR
The various aspects of the design and implementation of the scalable and persistent distributed priority queue system, the simulation process to verify the probabilistic behavior of the system, and the evaluation of thesystem’s performance in a distributed system are discussed.
Toward a modular and efficient distribution for Web service handlers
TLDR
This paper presents the Distributed Handler Architecture to provide an efficient, scalable, and modular architecture and shows that the distributed and parallel handler executions are very promising for suitable handler configurations.
Cost- and Performance-Aware Resource Management in Cloud Infrastructures
TLDR
High availability, cost effectiveness and ease of application deployment have accelerated the adoption rate of cloud computing and promotes the rapid development of cloud applications.
Architectural Evolution of Intelligent Transport Systems (ITS) using Cloud Computing
With the advent of Smart Cities, Intelligent Transport System (ITS) has become an efficient way of offering an accessible, safe, and sustainable transportation system. Utilizing advances in Informa…

References

SHOWING 1-10 OF 21 REFERENCES
Skiplist-based concurrent priority queues
  • N. Shavit, Itay Lotan
  • Computer Science
    Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000
  • 2000
TLDR
It is shown that a concurrent skiplist structure, following a simple set of modifications, provides a concurrent priority queue with a higher level of parallelism and significantly less contention than the fastest known heap-based algorithms.
An Efficient Algorithm for Concurrent Priority Queue Heaps
Concurrent Access of Priority Queues
TLDR
Experimental results on the BBN Butterfly parallel processor demonstrate that the use of concurrent-heap algorithms in parallel branch-and-bound improves its performance substantially.
Fast and lock-free concurrent priority queues for multi-thread systems
  • Håkan Sundell, P. Tsigas
  • Computer Science
    Proceedings International Parallel and Distributed Processing Symposium
  • 2003
We present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive…
Load Balanced Priority Queues on Distributed Memory Machines
TLDR
This work investigates two priority queues for priority queues on distributed memory multiprocessors, such as nCUBE, iPSc, MPP and loosely-coupled systems consisting of networked workstations, and results hold for other types of networks.
Parallel Algorithms for Priority Queue Operations
Randomized Shared Queues Applied to Distributed Optimization Algorithms
This paper presents a specification of a randomized shared queue that can lose some elements or return them out of order, and shows that the specification can be implemented with the probabilistic…
Parallelism and locality in priority queues
TLDR
It is shown that using a d-dimensional array (constant d) of P processors the authors can insert or delete the smallest P elements from a heap in time O(P/sup 1/d/log/Sup 1-1/ d/ P), where the number of elements in the heap is assumed to be polynomial in P.
Load Balances Priority Queues on Distributed Memory Machines
TLDR
Two priority queues for priority queues on distributed memory multiprocessors, such as nCUBE, iPSc, MPP and loosely-coupled systems consisting of networked workstations are investigated.
A Parallel Priority Queue with Constant Time Operations
TLDR
This data structure is the first to support multi-insertion and multi-decrease key in constant time, and can be implemented on the EREW PRAM and can perform any sequence of operations inO(n) time andO(mlogn) work, being the total number of keyes inserted and/or updated.
...
...