Abstract
Network coding has been shown to improve various performance metrics in computer networks. However, the use of network coding, especially random linear network coding, incurs serious time delay in the decoding process and thus it is imperative to use a network coding implementation that has low decoding latency characteristics, e.g. a parallelized implementation. In this paper, we investigate the problem of parallelizing Pipeline network coding, a variant of random linear coding recently developed in order to alleviate the problems of random linear coding. We propose a novel massively parallelized decoding algorithm leveraging General Purpose Graphics Processing Unit (GPGPU) and show its performance enhancement by up to 100% compared with previous GPGPU-based parallel algorithms via experiments on real systems.
Original language | English |
---|---|
Pages (from-to) | 233-240 |
Number of pages | 8 |
Journal | Computer Journal |
Volume | 57 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2014 Feb |
Keywords
- GPGPU
- Network coding
- Parallelization
ASJC Scopus subject areas
- Computer Science(all)