Accelerating a Bellman-Ford routing algorithm using GPU

This conference paper was presented in the 2014 FTRA International Symposium on Frontier and Innovation in Future Computing and Communications, FCC 2014; Auckland; New Zealand; 13 January 2014 through 16 January 2014 [© 2014 Springer Science+Business Media Dordrecht] The conference paper's defi...

詳細記述

書誌詳細
主要な著者: Jeong, In-Kyu, Uddin, Jia, Kang, Myeongsu, Kim, Cheol-Hong, Kim, Jong-Myon
その他の著者: Department of Computer Science and Engineering, BRAC University
フォーマット: Conference Paper
言語:English
出版事項: © 2014 Springer Verlag 2016
主題:
オンライン・アクセス:http://hdl.handle.net/10361/7019
http://dx.doi.org/10.1007/978-94-017-8798-7_19
id 10361-7019
record_format dspace
spelling 10361-70192016-11-28T10:16:20Z Accelerating a Bellman-Ford routing algorithm using GPU Jeong, In-Kyu Uddin, Jia Kang, Myeongsu Kim, Cheol-Hong Kim, Jong-Myon Department of Computer Science and Engineering, BRAC University Bellman-Ford algorithm Graphics processing unit Internet protocol routing Routing algorithm This conference paper was presented in the 2014 FTRA International Symposium on Frontier and Innovation in Future Computing and Communications, FCC 2014; Auckland; New Zealand; 13 January 2014 through 16 January 2014 [© 2014 Springer Science+Business Media Dordrecht] The conference paper's definite version is available at: :http://dx.doi.org/10.1007/978-94-017-8798-7_19 This paper presents a graphics processing unit (GPU)-based implementation of the Bellman-Ford (BF) routing algorithm used in distance-vector routing protocols. In the proposed GPU-based approach, multiple threads concurrently run in numerous streaming processors in the GPU to update the routing information instead of computing the individual vertex distances one-by-one, where an individual vertex distance is considered as a single thread. This paper compares the performance and energy consumption of the GPU-based approach with those of the equivalent central processing unit (CPU) implementation for varying the number of vertices. Experiment results show that the proposed approach outperforms the equivalent sequential CPU implementation in terms of execution time by exploiting massive parallelism inherent in the BF routing algorithm. Published 2016-11-28T10:13:52Z 2016-11-28T10:13:52Z 2014 Conference Paper Jeong, I. -., Uddin, J., Kang, M., Kim, C. -., & Kim, J. -. (2014). Accelerating a bellman-ford routing algorithm using GPU doi:10.1007/978-94-017-8798-7_19 18761100 http://hdl.handle.net/10361/7019 http://dx.doi.org/10.1007/978-94-017-8798-7_19 en http://link.springer.com/chapter/10.1007/978-94-017-8798-7_19 © 2014 Springer Verlag
institution Brac University
collection Institutional Repository
language English
topic Bellman-Ford algorithm
Graphics processing unit
Internet protocol routing
Routing algorithm
spellingShingle Bellman-Ford algorithm
Graphics processing unit
Internet protocol routing
Routing algorithm
Jeong, In-Kyu
Uddin, Jia
Kang, Myeongsu
Kim, Cheol-Hong
Kim, Jong-Myon
Accelerating a Bellman-Ford routing algorithm using GPU
description This conference paper was presented in the 2014 FTRA International Symposium on Frontier and Innovation in Future Computing and Communications, FCC 2014; Auckland; New Zealand; 13 January 2014 through 16 January 2014 [© 2014 Springer Science+Business Media Dordrecht] The conference paper's definite version is available at: :http://dx.doi.org/10.1007/978-94-017-8798-7_19
author2 Department of Computer Science and Engineering, BRAC University
author_facet Department of Computer Science and Engineering, BRAC University
Jeong, In-Kyu
Uddin, Jia
Kang, Myeongsu
Kim, Cheol-Hong
Kim, Jong-Myon
format Conference Paper
author Jeong, In-Kyu
Uddin, Jia
Kang, Myeongsu
Kim, Cheol-Hong
Kim, Jong-Myon
author_sort Jeong, In-Kyu
title Accelerating a Bellman-Ford routing algorithm using GPU
title_short Accelerating a Bellman-Ford routing algorithm using GPU
title_full Accelerating a Bellman-Ford routing algorithm using GPU
title_fullStr Accelerating a Bellman-Ford routing algorithm using GPU
title_full_unstemmed Accelerating a Bellman-Ford routing algorithm using GPU
title_sort accelerating a bellman-ford routing algorithm using gpu
publisher © 2014 Springer Verlag
publishDate 2016
url http://hdl.handle.net/10361/7019
http://dx.doi.org/10.1007/978-94-017-8798-7_19
work_keys_str_mv AT jeonginkyu acceleratingabellmanfordroutingalgorithmusinggpu
AT uddinjia acceleratingabellmanfordroutingalgorithmusinggpu
AT kangmyeongsu acceleratingabellmanfordroutingalgorithmusinggpu
AT kimcheolhong acceleratingabellmanfordroutingalgorithmusinggpu
AT kimjongmyon acceleratingabellmanfordroutingalgorithmusinggpu
_version_ 1814307973189599232