The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2010 vol.21)
pp: 1547-1560
Karam Park , Yonsei University, Seoul
Joon-Sang Park , Hongik University, Seoul
Won W. Ro , Yonsei University, Seoul
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 \times 1,024 coefficient matrix size.
INDEX TERMS
Conversion from sequential to parallel forms, parallel algorithms, concurrent programming, data communications, network communications.
CITATION
Karam Park, Joon-Sang Park, Won W. Ro, "On Improving Parallelized Network Coding with Dynamic Partitioning", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 11, pp. 1547-1560, November 2010, doi:10.1109/TPDS.2010.40
REFERENCES
[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] C. Gkantsidis, J. Miller, and P. Rodriguez, "Comprehensive View of a Live Network Coding P2P System," Proc. Internet Measurement Conf. (IMC '06), 2006.
[3] D. Geer, "Chip Makers Turn to Multicore Processors," Computer, vol. 38, no. 5, pp. 11-13, May 2005.
[4] H. Shojania and B. Li, "Parallelized Progressive Network Coding with Hardware Acceleration," Proc. 15th IEEE Int'l Workshop Quality of Service, pp. 47-55, June 2007.
[5] R. Koetter and M. Médard, "An Algebraic Approach to Network Coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
[6] P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. 51st Allerton Conf. Comm., Control and Computing, 2004.
[7] T. Ho, M. Médard, R. Koetter, D.R. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Trans. Information Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
[8] D.S. Lun, N. Ratnakar, M. Médard, R. Koetter, D.R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-Cost Multicast over Coded Packet Networks," IEEE/ACM Trans. Networking, vol. 14, no. 6, pp. 2608-2623, June 2006.
[9] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "XORs in the Air—Practical Wireless Network Coding," IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 497-510, June 2008.
[10] J.-S. Park, M. Gerla, D.S. Lun, Y. Yi, and M. Médard, "Codecast: A Network Coding Based Ad Hoc Multicast Protocol," IEEE Wireless Comm., vol. 13, no. 5, pp. 76-81, Oct. 2006.
[11] C. Gkantsidis and P.R. Rodriguez, "Network Coding for Large Scale Content Distribution," Proc. IEEE INFOCOM '05, vol. 4, pp. 2235-2245, Mar. 2005.
[12] M. Wang and B. Li, "Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming," Proc. IEEE INFOCOM '07, pp. 1082-1090, May 2007.
[13] U. Lee, J.-S. Park, J. Yeh, G. Pau, and M. Gerla, "CodeTorrent: Content Distribution Using Network Coding in VANETs," Proc. ACM MobiShare, 2006.
[14] G. Ma, Y. Xu, M. Lin, and Y. Xuan, "A Content Distribution System Based on Sparse Linear Network Coding," Proc. Third Workshop Network Coding (NetCod '07), 2007.
[15] P. Maymounkov, N.J.A. Harvey, and D.S. Lun, "Methods for Efficient Network Coding," Proc. Allerton Conf. Comm., Control, and Computing, 2006.
[16] L. Csánky, "Fast Parallel Matrix Inversion Algorithms," SIAM J. Computing, vol. 5, pp. 618-623, 1976.
[17] R.H. Bisseling and J.G.G. van de Vorst, "Parallel LU Decomposition on a Transputer Network," Proc. Shell Conf. Parallel Computing, pp. 61-77, 1989.
[18] N. Melab, E.-G. Talbi, and S. Petiton, "A Parallel Adaptive Gauss-Jordan Algorithm," J. Supercomputing, vol. 17, no. 2, pp. 167-185, 2000.
[19] J. Widmer and J.-Y. Le Boudec, "Network Coding for Efficient Communication in Extreme Networks," Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), pp. 284-291, 2005.
[20] M. Wang and B. Li, "How Practical Is Network Coding?" Proc. 14th IEEE Int'l Workshop Quality of Service (IWQoS '06), pp. 274-278, June 2006.
[21] B. Wilkinson and M. Allen, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, 2/E, pp. 355-356. Prentice Hall, 2004.
[22] A. Grama, G. Karypis, V. Kumar, and A. Gupta, Introduction to Parallel Computing 2/E, pp. 117-132. Addison Wesley, 2003.
[23] C. Lin and L. Snyder, Principles of Parallel Programming: International Edition, pp. 139-156. Pearson Higher, 2009.
[24] K. Park, J.-S. Park, and W.W. Ro, "Efficient Parallelized Network Coding for P2P File Sharing Applications," Proc. Fourth Int'l Conf. Grid and Pervasive Computing (GPC '09), May 2009.
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool