The JPEG still picture compression standard
Communications of the ACM - Special issue on digital multimedia systems
Optimal latency-throughput tradeoffs for data parallel pipelines
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Parallel JPEG2000 Image Coding on Multiprocessors
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Efficient collective communication in distributed heterogeneous systems
Journal of Parallel and Distributed Computing
A Parallel Pipelined Implementation of LOCO-I for JPEG-LS
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Efficient high-performance ASIC implementation of JPEG-LS encoder
Proceedings of the conference on Design, automation and test in Europe
Architectural exploration of heterogeneous multiprocessor systems for JPEG
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Acceleration of DCT Processing with Massive-Parallel Memory-Embedded SIMD Matrix Processor
IEICE - Transactions on Information and Systems
Multi-criteria scheduling of pipeline workflows
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
The JPEG2000 still image coding system: an overview
IEEE Transactions on Consumer Electronics
Optimizing latency and throughput of application workflows on clusters
Parallel Computing
| Hi-index | 0.00 |
Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput/period and latency (or a combination). Typical applications include digital image processing, where images are processed in steady-state mode. In this paper, we study the bi-criteria mapping (minimizing period and latency) of the JPEG encoding on a cluster of workstations. We present an integer linear programming formulation for this NP-hard problem, and we present an in-depth performance evaluation of several polynomial heuristics.