Earticle

초록

영어

The high speed CPU based routers currently in use could not handle the massive data required for real-time multimedia communication. Graphics processing units (GPUs) offer an appreciable alternative due to high computation power which results from their parallel execution units. This paper presents the implementation of the Dijkstra’s link state IP routing algorithm using GPU. Experimental results show that the proposed GPU-based approach outperforms the same sequential CPU-based implementation in terms of execution time for the same dense graph. In addition, the proposed GPU-based approach reduces about 99% energy consumption over the CPU-based implementation.

목차

Abstract
 1. Introduction
 2. Background Information
  2.1. GPU and CUDA Interaction
  2.2. Graph Mapping on CUDA
  2.3. The Dijkstra’s Algorithm
 3. Implementation of Parallel Dijkstra’s Algorithm Using CUDA
 4. Performance Metrics
  4.1. Throughput
  4.2. Speedup
  4.3. Power and Energy Consumption
 5. Experimental Results and Analysis
  5.1. Performance of the GPU-based Approach
  5.2. Average Power and Energy Consumption of GPU over CPU
 6. Conclusions
 Acknowledgements
 References

키워드

저자

• Jia Uddin [ School of Electrical Engineering, University of Ulsan, Ulsan, South Korea ]
• Emmanuel Oyekanlu [ Department of Electrical and Computer Engineering, Drexel University, Philadelphia, Pennsylvania, USA ]
• Cheol-Hong Kim [ School of Electronics and Computer Engineering, Chonnam National University, South Korea ]
• Jong-Myon Kim [ School of Electrical Engineering, University of Ulsan, Ulsan, South Korea ] Corresponding author.

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605