Welcome to the upgraded BRAC University Institutional Repository. We are currently organizing collections after a recent system upgrade. Homepage category counters may temporarily show lower numbers while syncing, but over 27,000 repository items remain safe and accessible. Please use the search bar to find theses, scholarly outputs, and institutional documents.

Accelerating IP routing algorithm using graphics processing unit for high speed multimedia communication

dc.contributor.authorUddin, Jia
dc.contributor.authorJeong, In-Kyu
dc.contributor.authorKang, Myeongsu
dc.contributor.authorKim, Cheol-Hong
dc.contributor.authorKim, Jong-Myon
dc.contributor.departmentDepartment of Computer Science and Engineering
dc.date.accessioned2016-11-28T05:29:46Z
dc.date.available2016-11-28T05:29:46Z
dc.date.issued2016
dc.descriptionThis article was published in Multimedia Tools and Applications [© 2014, Springer Science+Business Media New York.] and the definite version is available at :http://dx.doi.org/10.1007/s11042-014-2013-3 The Journal's website is at: http://link.springer.com/article/10.1007/s11042-014-2013-3en_US
dc.description.abstractThis paper presents a Graphics Processing Unit (GPU)-based implementation of a Bellman-Ford (BF) routing algorithm using NVIDIA’s Compute Unified Device Architecture (CUDA). In the proposed GPU-based approach, multiple threads run concurrently over numerous streaming processors in the GPU to dynamically update routing information. Instead of computing the individual vertex distances one-by-one, a number of threads concurrently update a larger number of vertex distances, and an individual vertex distance is represented in a single thread. This paper compares the performance of the GPU-based approach to an equivalent CPU implementation while varying the number of vertices. Experimental results show that the proposed GPU-based approach outperforms the equivalent sequential CPU implementation in terms of execution time by exploiting the massive parallelism inherent in the BF routing algorithm. In addition, the reduction in energy consumption (about 99 %) achieved by using the GPU is reflective of the overall merits of deploying GPUs across the entire landscape of IP routing for emerging multimedia communications.en_US
dc.description.versionPublished
dc.identifier.citationUddin, J., Jeong, I. -., Kang, M., Kim, C. -., & Kim, J. -. (2016). Accelerating IP routing algorithm using graphics processing unit for high speed multimedia communication. Multimedia Tools and Applications, 75(23), 15365-15379. doi:10.1007/s11042-014-2013-3en_US
dc.identifier.doihttp://dx.doi.org/10.1007/s11042-014-2013-3
dc.identifier.issn13807501
dc.identifier.urihttp://hdl.handle.net/10361/7005
dc.language.isoenen_US
dc.publisher© 2016 Springer New York LLCen_US
dc.relation.urihttp://link.springer.com/article/10.1007/s11042-014-2013-3
dc.subjectBellman-Ford algorithmen_US
dc.subjectClustering computingen_US
dc.subjectGraphics processing uniten_US
dc.subjectIP routingen_US
dc.titleAccelerating IP routing algorithm using graphics processing unit for high speed multimedia communicationen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: