Although MPEG-1 Video is a promising and the most widely used moving picture compression standard it requires a lot of computational resources to encode the moving pictures with a reasonable frame size and quality. In this paper we propose and implement an efficient parallelizing scheme for an MPEG-1 Video encoding algorithm on Ethernet-connected workstations which is the most widely available computing environment nowadays. In this parallelizing scheme, the slice-level, frame-level, and GOP (Group of Pictures)-level parallelisms are identified as the attractive parallelisms that can be exploited in Ethernet-connected workstations. Three efficient parallel implementation schemes considering the communication characteristics of Ethernet-connected workstations are also proposed and experimented A series of experiments using thirty workstations shows that the MPEG-1 Video encoding time can be reduced in proportional to the number of workstations used in encoding computations although there is a saturation point in the speedup graphs.
[1]
Didier Le Gall,et al.
MPEG: a video compression standard for multimedia applications
,
1991,
CACM.
[2]
Borko Furht,et al.
Multimedia systems: an overview
,
1994,
IEEE MultiMedia.
[3]
Lawrence A. Rowe,et al.
Parallel MPEG-1 Video Encoding
,
1999
.
[4]
Gregory K. Wallace,et al.
The JPEG still picture compression standard
,
1992
.
[5]
Howard Jay Siegel,et al.
Parallel Implementations of Block-Based Motion Vector Estimation for Video Compression on the MasPar MP-1 and PASM
,
1995,
ICPP.
[6]
Ming Lei Liou,et al.
Overview of the p×64 kbit/s video coding standard
,
1991,
CACM.
[7]
Frans Sijstermans,et al.
CD-I full-motion video encoding on a parallel computer
,
1991,
CACM.