PHEFT: pessimistic image processing workflow scheduling for DSP clusters (Q2283878)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PHEFT: pessimistic image processing workflow scheduling for DSP clusters |
scientific article |
Statements
PHEFT: pessimistic image processing workflow scheduling for DSP clusters (English)
0 references
13 January 2020
0 references
Summary: 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.
0 references
DSP microprocessor
0 references
multicore
0 references
multiprocessors
0 references
scheduling
0 references
workflow
0 references
resource management
0 references
job allocation
0 references