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

Deokho Kim, Karam Park, Won W. Ro

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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
Issue number1
Publication statusPublished - 2013 Jan

Bibliographical note

Funding Information:
This work was supported by the Basic Science Research Program through the National Research Foundation (NRF) of Korea, which is funded by the Ministry of Education, Science and Technology [2009-0070364].

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Exploiting SIMD parallelism on dynamically partitioned parallel network coding for P2P systems'. Together they form a unique fingerprint.

Cite this