Accelerated network coding with dynamic stream decomposition on graphics processing unit

Sangpil Lee, Won W. Ro

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Network coding, a well-known technique for optimizing data-flow in wired and wireless network systems, has attracted considerable attention in various fields. However, the decoding complexity in network coding becomes a major performance bottleneck in the practical network systems; thus, several researches have been conducted for improving the decoding performance in network coding. Nevertheless, previously proposed parallel network coding algorithms have shown limited scalability and performance imbalance for different-sized transfer units and multiple streams. In this paper, we propose a new parallel decoding algorithm for network coding using a graphics processing unit (GPU). This algorithm can simultaneously process multiple incoming streams and can maintain its maximum decoding performance irrespective of the size and number of transfer units. Our experimental results show that the proposed algorithm exhibits a 682.2 Mbps decoding bandwidth on a system with GeForce GTX 285 GPU and speed-ups of up to 26 as compared to the existing single stream decoding procedure with a 128 × 128 coefficient matrix and different-sized data blocks.

Original languageEnglish
Pages (from-to)21-34
Number of pages14
JournalComputer Journal
Volume55
Issue number1
DOIs
Publication statusPublished - 2012 Jan 1

Fingerprint

Network coding
Decoding
Decomposition
Graphics processing unit
Scalability
Wireless networks
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

@article{d6842595fee94f4cb0cc5262c3c2725e,
title = "Accelerated network coding with dynamic stream decomposition on graphics processing unit",
abstract = "Network coding, a well-known technique for optimizing data-flow in wired and wireless network systems, has attracted considerable attention in various fields. However, the decoding complexity in network coding becomes a major performance bottleneck in the practical network systems; thus, several researches have been conducted for improving the decoding performance in network coding. Nevertheless, previously proposed parallel network coding algorithms have shown limited scalability and performance imbalance for different-sized transfer units and multiple streams. In this paper, we propose a new parallel decoding algorithm for network coding using a graphics processing unit (GPU). This algorithm can simultaneously process multiple incoming streams and can maintain its maximum decoding performance irrespective of the size and number of transfer units. Our experimental results show that the proposed algorithm exhibits a 682.2 Mbps decoding bandwidth on a system with GeForce GTX 285 GPU and speed-ups of up to 26 as compared to the existing single stream decoding procedure with a 128 × 128 coefficient matrix and different-sized data blocks.",
author = "Sangpil Lee and Ro, {Won W.}",
year = "2012",
month = "1",
day = "1",
doi = "10.1093/comjnl/bxq087",
language = "English",
volume = "55",
pages = "21--34",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "1",

}

Accelerated network coding with dynamic stream decomposition on graphics processing unit. / Lee, Sangpil; Ro, Won W.

In: Computer Journal, Vol. 55, No. 1, 01.01.2012, p. 21-34.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Accelerated network coding with dynamic stream decomposition on graphics processing unit

AU - Lee, Sangpil

AU - Ro, Won W.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - Network coding, a well-known technique for optimizing data-flow in wired and wireless network systems, has attracted considerable attention in various fields. However, the decoding complexity in network coding becomes a major performance bottleneck in the practical network systems; thus, several researches have been conducted for improving the decoding performance in network coding. Nevertheless, previously proposed parallel network coding algorithms have shown limited scalability and performance imbalance for different-sized transfer units and multiple streams. In this paper, we propose a new parallel decoding algorithm for network coding using a graphics processing unit (GPU). This algorithm can simultaneously process multiple incoming streams and can maintain its maximum decoding performance irrespective of the size and number of transfer units. Our experimental results show that the proposed algorithm exhibits a 682.2 Mbps decoding bandwidth on a system with GeForce GTX 285 GPU and speed-ups of up to 26 as compared to the existing single stream decoding procedure with a 128 × 128 coefficient matrix and different-sized data blocks.

AB - Network coding, a well-known technique for optimizing data-flow in wired and wireless network systems, has attracted considerable attention in various fields. However, the decoding complexity in network coding becomes a major performance bottleneck in the practical network systems; thus, several researches have been conducted for improving the decoding performance in network coding. Nevertheless, previously proposed parallel network coding algorithms have shown limited scalability and performance imbalance for different-sized transfer units and multiple streams. In this paper, we propose a new parallel decoding algorithm for network coding using a graphics processing unit (GPU). This algorithm can simultaneously process multiple incoming streams and can maintain its maximum decoding performance irrespective of the size and number of transfer units. Our experimental results show that the proposed algorithm exhibits a 682.2 Mbps decoding bandwidth on a system with GeForce GTX 285 GPU and speed-ups of up to 26 as compared to the existing single stream decoding procedure with a 128 × 128 coefficient matrix and different-sized data blocks.

UR - http://www.scopus.com/inward/record.url?scp=84555194901&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84555194901&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxq087

DO - 10.1093/comjnl/bxq087

M3 - Article

AN - SCOPUS:84555194901

VL - 55

SP - 21

EP - 34

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 1

ER -