High-Speed shortest path co-processor design
Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Conference or Workshop Item |
Published: |
2009
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/2287/ https://ieeexplore.ieee.org/document/5072059 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.um.eprints.2287 |
---|---|
record_format |
eprints |
spelling |
my.um.eprints.22872019-02-07T04:42:52Z http://eprints.um.edu.my/2287/ High-Speed shortest path co-processor design Idris, Mohd Yamani Idna Abu Bakar, Suraya Tamil, Emran Mohd Razak, Zaidi Noor, Noorzaily Mohamed QA75 Electronic computers. Computer science Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the output which later on will slow down the overall performance. Therefore, the authors proposed a hardware approach which implements FPGA technology to find the shortest path between two nodes. The FPGA approach will demonstrate how parallelism can be used to significantly reduce calculation steps compared to sequential effort. In this paper, A-Star algorithm has been chosen for the shortest path calculation since it can achieve superior time running based on its heuristic behavior. 2009 Conference or Workshop Item PeerReviewed Idris, Mohd Yamani Idna and Abu Bakar, Suraya and Tamil, Emran Mohd and Razak, Zaidi and Noor, Noorzaily Mohamed (2009) High-Speed shortest path co-processor design. In: 3rd Asia International Conference on Modelling and Simulation, 25-29 May 2009, Bali, Indonesia. https://ieeexplore.ieee.org/document/5072059 |
institution |
Universiti Malaya |
building |
UM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Malaya |
content_source |
UM Research Repository |
url_provider |
http://eprints.um.edu.my/ |
topic |
QA75 Electronic computers. Computer science |
spellingShingle |
QA75 Electronic computers. Computer science Idris, Mohd Yamani Idna Abu Bakar, Suraya Tamil, Emran Mohd Razak, Zaidi Noor, Noorzaily Mohamed High-Speed shortest path co-processor design |
description |
Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the output which later on will slow down the overall performance. Therefore, the authors proposed a hardware approach which implements FPGA technology to find the shortest path between two nodes. The FPGA approach will demonstrate how parallelism can be used to significantly reduce calculation steps compared to sequential effort. In this paper, A-Star algorithm has been chosen for the shortest path calculation since it can achieve superior time running based on its heuristic behavior. |
format |
Conference or Workshop Item |
author |
Idris, Mohd Yamani Idna Abu Bakar, Suraya Tamil, Emran Mohd Razak, Zaidi Noor, Noorzaily Mohamed |
author_facet |
Idris, Mohd Yamani Idna Abu Bakar, Suraya Tamil, Emran Mohd Razak, Zaidi Noor, Noorzaily Mohamed |
author_sort |
Idris, Mohd Yamani Idna |
title |
High-Speed shortest path co-processor design |
title_short |
High-Speed shortest path co-processor design |
title_full |
High-Speed shortest path co-processor design |
title_fullStr |
High-Speed shortest path co-processor design |
title_full_unstemmed |
High-Speed shortest path co-processor design |
title_sort |
high-speed shortest path co-processor design |
publishDate |
2009 |
url |
http://eprints.um.edu.my/2287/ https://ieeexplore.ieee.org/document/5072059 |
_version_ |
1643686893231013888 |
score |
13.15806 |