The Community for Technology Leaders
Green Image
Issue No. 11 - November (2010 vol. 21)
ISSN: 1045-9219
pp: 1547-1560
Karam Park , Yonsei University, Seoul
Joon-Sang Park , Hongik University, Seoul
Won W. Ro , Yonsei University, Seoul
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 \times 1,024 coefficient matrix size.
Conversion from sequential to parallel forms, parallel algorithms, concurrent programming, data communications, network communications.

J. Park, W. W. Ro and K. Park, "On Improving Parallelized Network Coding with Dynamic Partitioning," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 1547-1560, 2010.
84 ms
(Ver 3.3 (11022016))