PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters

Abstract

We address image processing workflow scheduling problems on a multicore digital signal processor cluster. We present an experimental study of scheduling strategies that include task labeling, prioritization, resource selection, and digital signal processor scheduling. We apply these strategies in the context of executing the Ligo and Montage applications. To provide effective guidance in choosing a good strategy, we present a joint analysis of three conflicting goals based on performance degradation. A case study is given, and experimental results demonstrate that a pessimistic scheduling approach provides the best optimization criteria trade-offs. The Pessimistic Heterogeneous Earliest Finish Time scheduling algorithm performs well in different scenarios with a variety of workloads and cluster configurations.

Special Issue on Algorithms for Scheduling Problems

“…The paper [10] deals with an image processing work-flow scheduling problem on a multi-core digital signal processor cluster. It presents an experimental study of scheduling strategies including task labeling, prioritization, and resource selection.…”

HPEFT for Hierarchical Heterogeneous Multi-DAG in a Multigroup Scan UPA System

“…By applying stochastic stability analysis, model transformation techniques and graph theory, sufficient conditions of mean square consensus and H ∞ consensus are obtained, respectively. Drozdov [22] address image processing workflow scheduling problems on a multicore digital signal processor cluster. They proposed Pessimistic Heterogeneous Earliest Finish Time scheduling algorithm for Ligo and Montage applications and presented its better performance than others.…”