Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems

Deokho Kim, Karam Park, Won Woo Ro

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Due to the decoding complexity of network coding, there have been concerns on adopting network coding in the practical P2P systems. To provide rapid decoding speed in practical network coding systems, various multi-threaded approaches which successfully exploit hardware supported TLP have been proposed. Among those parallel approaches, a dynamic partitioning method is known to be the best solution so far. However, the algorithm dynamically changes workload distribution and inherently contains some limits to utilize the SIMD instruction set which are designed to work on a fixed size of data. In this paper, we present a new data manipulation method to utilize SIMD instruction sets, which can be successfully integrated into the dynamic partitioning of thread-level workload distribution. With exploiting both SIMD and thread-level parallelism, we achieve the speed-up of 10.86 using eight running threads compared to the serial algorithm.

Original languageEnglish
Pages (from-to)55-66
Number of pages12
JournalComputers and Electrical Engineering
Volume39
Issue number1
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

Network coding
Decoding
Hardware

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

@article{b970444805a94488b7792addc262bc3f,
title = "Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems",
abstract = "Due to the decoding complexity of network coding, there have been concerns on adopting network coding in the practical P2P systems. To provide rapid decoding speed in practical network coding systems, various multi-threaded approaches which successfully exploit hardware supported TLP have been proposed. Among those parallel approaches, a dynamic partitioning method is known to be the best solution so far. However, the algorithm dynamically changes workload distribution and inherently contains some limits to utilize the SIMD instruction set which are designed to work on a fixed size of data. In this paper, we present a new data manipulation method to utilize SIMD instruction sets, which can be successfully integrated into the dynamic partitioning of thread-level workload distribution. With exploiting both SIMD and thread-level parallelism, we achieve the speed-up of 10.86 using eight running threads compared to the serial algorithm.",
author = "Deokho Kim and Karam Park and Ro, {Won Woo}",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.compeleceng.2012.02.009",
language = "English",
volume = "39",
pages = "55--66",
journal = "Computers and Electrical Engineering",
issn = "0045-7906",
publisher = "Elsevier Limited",
number = "1",

}

Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems. / Kim, Deokho; Park, Karam; Ro, Won Woo.

In: Computers and Electrical Engineering, Vol. 39, No. 1, 01.01.2013, p. 55-66.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems

AU - Kim, Deokho

AU - Park, Karam

AU - Ro, Won Woo

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Due to the decoding complexity of network coding, there have been concerns on adopting network coding in the practical P2P systems. To provide rapid decoding speed in practical network coding systems, various multi-threaded approaches which successfully exploit hardware supported TLP have been proposed. Among those parallel approaches, a dynamic partitioning method is known to be the best solution so far. However, the algorithm dynamically changes workload distribution and inherently contains some limits to utilize the SIMD instruction set which are designed to work on a fixed size of data. In this paper, we present a new data manipulation method to utilize SIMD instruction sets, which can be successfully integrated into the dynamic partitioning of thread-level workload distribution. With exploiting both SIMD and thread-level parallelism, we achieve the speed-up of 10.86 using eight running threads compared to the serial algorithm.

AB - Due to the decoding complexity of network coding, there have been concerns on adopting network coding in the practical P2P systems. To provide rapid decoding speed in practical network coding systems, various multi-threaded approaches which successfully exploit hardware supported TLP have been proposed. Among those parallel approaches, a dynamic partitioning method is known to be the best solution so far. However, the algorithm dynamically changes workload distribution and inherently contains some limits to utilize the SIMD instruction set which are designed to work on a fixed size of data. In this paper, we present a new data manipulation method to utilize SIMD instruction sets, which can be successfully integrated into the dynamic partitioning of thread-level workload distribution. With exploiting both SIMD and thread-level parallelism, we achieve the speed-up of 10.86 using eight running threads compared to the serial algorithm.

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

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

U2 - 10.1016/j.compeleceng.2012.02.009

DO - 10.1016/j.compeleceng.2012.02.009

M3 - Article

AN - SCOPUS:84874116631

VL - 39

SP - 55

EP - 66

JO - Computers and Electrical Engineering

JF - Computers and Electrical Engineering

SN - 0045-7906

IS - 1

ER -