Bi-criteria Pipeline Mappings for Parallel Image Processing

Simple item page
dc.creatorBenoit, Anne
dc.creatorKosch, Harald
dc.creatorRehn-Sonigo, Veronika
dc.creatorRobert, Yves
dc.date2008-01-11
dc.date.accessioned2026-07-07T08:54:00Z
dc.date.available2026-07-07T08:54:00Z
dc.descriptionMapping 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 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 mapping of a particular image processing application, the JPEG encoding. Mapping pipelined JPEG encoding onto parallel platforms is useful for instance for encoding Motion JPEG images. As the bi-criteria mapping problem is NP-complete, we concentrate on the evaluation and performance of polynomial heuristics.
dc.identifierhttps://arxiv.org/abs/0801.1772
dc.identifierhttp://arxiv.org/abs/0801.1772
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145779
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleBi-criteria Pipeline Mappings for Parallel Image Processing
dc.typetext

Files

Collections

arXiv