Parallel algorithms for MPEG video compression with PVM

This paper presents parallel algorithms for MPEG video compression by using the PVM library. Because of the huge amount of computation, a sequential software encoder is slow at the coding of reasonably sized images (e.g. 0.1-0.3 frames per second). In order to speed up the process, we developed two kinds of parallel algorithm, which run on a cluster of workstations connected to the network. The first method encodes slices in parallel, while the second one encodes equally sized Groups Of Pictures (GOP) in parallel. The communication between the machines is facilitated by the PVM package. The reference sequential algorithm can encode a SIF sized sequence at 0.2 frames per second on a SUN Sparc 2 using the GOP pattern of IBBP. The slice level parallelization can take this rate up to nearly 0.7 frames per second with the use of 6 Sparc 2s connected via Ethernet. The degradation of the performance is a consequence of the low bandwidth of the network and the relatively high

• Type: Conference
• Year: 1996
• Where: EUROSIM
• Authors: Sándor Bozoki, S. J. P. Westen, Reginald L. Lagendijk, Jan Biemond
• Keywords: Distributed And Parallel Computing, EUROSIM 1996, Method Encodes Slices, Parallel Algorithm, Sequential Software Encoder