Show simple item record

dc.contributor.authorJeong, In-Kyu
dc.contributor.authorUddin, Jia
dc.contributor.authorKang, Myeongsu
dc.contributor.authorKim, Cheol-Hong
dc.contributor.authorKim, Jong-Myon
dc.date.accessioned2016-11-28T10:13:52Z
dc.date.available2016-11-28T10:13:52Z
dc.date.issued2014
dc.identifier.citationJeong, 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_19en_US
dc.identifier.issn18761100
dc.identifier.urihttp://hdl.handle.net/10361/7019
dc.descriptionThis 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_19en_US
dc.description.abstractThis 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.en_US
dc.language.isoenen_US
dc.publisher© 2014 Springer Verlagen_US
dc.relation.urihttp://link.springer.com/chapter/10.1007/978-94-017-8798-7_19
dc.subjectBellman-Ford algorithmen_US
dc.subjectGraphics processing uniten_US
dc.subjectInternet protocol routingen_US
dc.subjectRouting algorithmen_US
dc.titleAccelerating a Bellman-Ford routing algorithm using GPUen_US
dc.typeConference Paperen_US
dc.description.versionPublished
dc.contributor.departmentDepartment of Computer Science and Engineering, BRAC University
dc.identifier.doihttp://dx.doi.org/10.1007/978-94-017-8798-7_19


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record