Abstract | ||
---|---|---|
Multimedia compression algorithms usually take DCT or wavelet transformed input data and produce a stream of bits as output. It has been shown that compression algorithms can be parallelized in a data driven way so that a sequence of bit-stream parts is produced by each processing element (PE) corresponding to the PE-local part of the partitioned and distributed input data. Unfortunately, the collection and assembly of these bit-stream parts by a single PE turns out to be a major bottleneck because it is sequential. This work addresses this problem by sequential optimizations and parallelization of the assembly process itself. |
Year | DOI | Venue |
---|---|---|
2002 | 10.12694/scpe.v5i3.293 | Scalable Computing: Practice and Experience |
Keywords | Field | DocType |
video coding,transform coding,parallel processing,wavelet transform,compression algorithm | Bottleneck,Data-driven,Computer science,Multimedia compression,Parallel computing,Discrete cosine transform,Processing element,Bitstream,Data compression,Wavelet | Journal |
Volume | Issue | Citations |
5 | 3 | 0 |
PageRank | References | Authors |
0.34 | 7 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rade Kutil | 1 | 61 | 8.80 |