Universiti Teknologi Malaysia Institutional Repository

Accelerating graph algorithms with priority queue processor

Heng Sun, Ch'ng and Eik Wee, Chew and Shaikh-Husin, Nasir and Hani, Mohamed Khalil (2006) Accelerating graph algorithms with priority queue processor. Regional Postgraduate Conference on Engineering and Science . pp. 257-262.



Graphs are a pervasive data structure in computer science, and algorithms working with them are fundamental to the field. Of the various graph algorithms, techniques for searching a graph are the heart of graph algorithms. Many graph algorithms are organized as simple elaborations of basic graph searching algorithms. For the searching of a graph, Priority Queue is used to maintain the tentative search result and choice of priority queue implementation would significantly affect the run-time and memory consumption of a graph algorithm. In this work, we demonstrate how to accelerate graph algorithms using priority queue processor. DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. Assuming embedded hardware-software codesign, results show that our priority queue processor performs better than software implementation, and the run-time complexity of DijkstraÂ’s algorithm is reduced from O(n lg n) in software implementation to O(n) with our priority queue processor.

Item Type:Article
Uncontrolled Keywords:Graph Algorithms, Shortest Path Routing, Priority Queue, Priority Queue Processor
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:Electrical Engineering
ID Code:1689
Deposited By: Dr Zaharuddin Mohamed
Deposited On:13 Mar 2007 01:59
Last Modified:16 Apr 2012 03:30

Repository Staff Only: item control page