We study the impact of using different priority queues in the performance of Dijkstra’s SSSP algorithm. We consider only general priority queues that can handle any type of keys (integer, floating point, etc.); the only exception is that we use as a benchmark the DIMACS Challenge SSSP code [1] which can handle only integer values for distances. Our experiments were focussed on the following: 1....

The design and operation of modern software systems exhibit a shift towards virtualization, containerization service-based orchestration. Performance capacity engineering resource utilization tuning become priority requirements in such environments.
 Measurement-based performance evaluation is the cornerstone designing for performance. Moreover, increasing complexity necessitates rigorous ...

The priority queue is an useful data structure in computation. There currently exist many implementations of this data structure, including some that are cache-aware and some cache-oblivious. In this study, we compare the performance of several implementations of priority queues in Dijkstra’s Single Source Shortest Path algorithm. We compare high performance heaps, such as the 4ary Aligned Heap...

The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a priority queue, from which node pairs are retrieved while traversing R-trees in top-down manners in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during di...

oo many organizations view electronic records management (ERM) software selection through a narrow lens. Some enterprises will create massive spreadsheet-based matrices with lists of features and functions broken down in minute detail. These features and functions are weighted by priority, then added and scored to rank vendors and products based on empirical data. This can be a useful exercise ...

A wireless ad-hoc network is a self-organized wireless network without fixed or backbone infrastructure. All nodes have routing capability and use peer-to-peer packet transmission or forward packets to other node using multi hop communication. Now days mobile ad-hoc networks are being used for different applications and traffics, so it require quality of service (QoS) support in routing protoco...

Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such image analysis algorithms specify which implementation of the priority queue was used. Many assessments of priority queues can be found in the lit...