Effective parallel algorithm for GPGPU-accelerated explicit routing optimization

Ko Kikuta, Eiji Oki, Naoaki Yamanaka, Nozomu Togawa, Hidenori Nakazato

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

The recent development of network technologies that offer centralized control of explicit routes opens the door to the online optimization of explicit routing. For this kind of Traffic Engineering optimization, raising the calculation speeds by using multi-core processors with effective parallel algorithms is a key goal. This paper proposes an effective parallel algorithm for General purpose Programming on Graphic Processing Unit (GPGPU); its massively parallel style promises strong acceleration of calculation speed. The proposed algorithm parallelizes not only the search method of the Genetic Algorithm, but also its fitness functions, which calculate the network congestion ratio, so as to fully utilize the power of modern GPGPUs. Concurrently, each execution is designed for thread-block execution on the GPU with consideration of thread occupancy, local resources, and SIMT execution to maximize GPU performance. Evaluations show that the proposed algorithm offers, on average, a nine fold speedup compared to the conventional CPU approach.

本文言語English
ホスト出版物のタイトル2015 IEEE Global Communications Conference, GLOBECOM 2015
出版社Institute of Electrical and Electronics Engineers Inc.
ISBN(電子版)9781479959525
DOI
出版ステータスPublished - 2015
イベント58th IEEE Global Communications Conference, GLOBECOM 2015 - San Diego, United States
継続期間: 2015 12 62015 12 10

出版物シリーズ

名前2015 IEEE Global Communications Conference, GLOBECOM 2015

Other

Other58th IEEE Global Communications Conference, GLOBECOM 2015
CountryUnited States
CitySan Diego
Period15/12/615/12/10

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

フィンガープリント 「Effective parallel algorithm for GPGPU-accelerated explicit routing optimization」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル