On improving parallelized network coding with dynamic partitioning

Karam Park, Joon Sang Park, Won W. Ro

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

In this paper, we investigate parallel implementation techniques for network coding. It is known that network coding is useful for both wired and wireless networks and it also mitigates peer/piece selection problems in P2P file sharing systems. However, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in practical network systems and to improve the decoding performance, the exploitation of parallelism has been proposed previously. In this paper, we argue that naive parallelization strategies of network coding may result in unbalanced workload distribution, and thus, limiting performance improvements. We further argue that a higher performance enhancement can be achieved through balanced partitioning methods in parallelized network coding and propose new parallelization techniques for network coding. Our experiments show that on a quad-core processor system, proposed algorithms exhibit up to 5.69 speedup which is better than the linear speedup with the influence of additional cache. Moreover, on an octal-core system, our algorithms even achieve speedup of 8.46 compared to a sequential network coding and 43.3 percent faster than an existing parallelized technique using 1 Mbytes data with 1,024 × 1,024 coefficient matrix size.

Original languageEnglish
Article number5416700
Pages (from-to)1547-1560
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Volume21
Issue number11
DOIs
Publication statusPublished - 2010 Sep 14

Fingerprint

Network coding
Decoding
Wireless networks

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{abc38e0899b74261846208fef79d713f,
title = "On improving parallelized network coding with dynamic partitioning",
abstract = "In this paper, we investigate parallel implementation techniques for network coding. It is known that network coding is useful for both wired and wireless networks and it also mitigates peer/piece selection problems in P2P file sharing systems. However, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in practical network systems and to improve the decoding performance, the exploitation of parallelism has been proposed previously. In this paper, we argue that naive parallelization strategies of network coding may result in unbalanced workload distribution, and thus, limiting performance improvements. We further argue that a higher performance enhancement can be achieved through balanced partitioning methods in parallelized network coding and propose new parallelization techniques for network coding. Our experiments show that on a quad-core processor system, proposed algorithms exhibit up to 5.69 speedup which is better than the linear speedup with the influence of additional cache. Moreover, on an octal-core system, our algorithms even achieve speedup of 8.46 compared to a sequential network coding and 43.3 percent faster than an existing parallelized technique using 1 Mbytes data with 1,024 × 1,024 coefficient matrix size.",
author = "Karam Park and Park, {Joon Sang} and Ro, {Won W.}",
year = "2010",
month = "9",
day = "14",
doi = "10.1109/TPDS.2010.40",
language = "English",
volume = "21",
pages = "1547--1560",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "11",

}

On improving parallelized network coding with dynamic partitioning. / Park, Karam; Park, Joon Sang; Ro, Won W.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 11, 5416700, 14.09.2010, p. 1547-1560.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On improving parallelized network coding with dynamic partitioning

AU - Park, Karam

AU - Park, Joon Sang

AU - Ro, Won W.

PY - 2010/9/14

Y1 - 2010/9/14

N2 - In this paper, we investigate parallel implementation techniques for network coding. It is known that network coding is useful for both wired and wireless networks and it also mitigates peer/piece selection problems in P2P file sharing systems. However, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in practical network systems and to improve the decoding performance, the exploitation of parallelism has been proposed previously. In this paper, we argue that naive parallelization strategies of network coding may result in unbalanced workload distribution, and thus, limiting performance improvements. We further argue that a higher performance enhancement can be achieved through balanced partitioning methods in parallelized network coding and propose new parallelization techniques for network coding. Our experiments show that on a quad-core processor system, proposed algorithms exhibit up to 5.69 speedup which is better than the linear speedup with the influence of additional cache. Moreover, on an octal-core system, our algorithms even achieve speedup of 8.46 compared to a sequential network coding and 43.3 percent faster than an existing parallelized technique using 1 Mbytes data with 1,024 × 1,024 coefficient matrix size.

AB - In this paper, we investigate parallel implementation techniques for network coding. It is known that network coding is useful for both wired and wireless networks and it also mitigates peer/piece selection problems in P2P file sharing systems. However, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in practical network systems and to improve the decoding performance, the exploitation of parallelism has been proposed previously. In this paper, we argue that naive parallelization strategies of network coding may result in unbalanced workload distribution, and thus, limiting performance improvements. We further argue that a higher performance enhancement can be achieved through balanced partitioning methods in parallelized network coding and propose new parallelization techniques for network coding. Our experiments show that on a quad-core processor system, proposed algorithms exhibit up to 5.69 speedup which is better than the linear speedup with the influence of additional cache. Moreover, on an octal-core system, our algorithms even achieve speedup of 8.46 compared to a sequential network coding and 43.3 percent faster than an existing parallelized technique using 1 Mbytes data with 1,024 × 1,024 coefficient matrix size.

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

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

U2 - 10.1109/TPDS.2010.40

DO - 10.1109/TPDS.2010.40

M3 - Article

AN - SCOPUS:77957750759

VL - 21

SP - 1547

EP - 1560

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 11

M1 - 5416700

ER -