Accelerating graph algorithms with priority queue processor
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 se...
Saved in:
Main Authors: | Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil |
---|---|
Format: | Article |
Language: | English |
Published: |
School of Postgraduate Studies, UTM
2006
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/1689/1/sh-nasir06_Accelerating_graph_algorithm.pdf http://eprints.utm.my/id/eprint/1689/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
by: Ch'ng, Heng Sun
Published: (2007) -
Nano-scale VLSI clock routing module based on useful-skew tree algorithm
by: Eik Wee, Chew, et al.
Published: (2006) -
An AES tightly coupled hardware accelerator in an FPGA-based Embedded processor core
by: Hani, Mohamed Khalil, et al.
Published: (2009) -
An optimization algorithm based on grid-graphs for minimizing interconnect delay in VLSI layout design
by: Mohd. Hani, Mohamed Khalil, et al.
Published: (2009) -
Performance evaluation of a 3-priority based Mixed Priority Queueing (MPQ) policy with application to input and output queueing ATM switch
by: Mohd Ali, Borhanuddin, et al.