Next Article in Journal
A Novel Design of Sparse Prototype Filter for Nearly Perfect Reconstruction Cosine-Modulated Filter Banks
Next Article in Special Issue
Scheduling a Single Machine with Primary and Secondary Objectives
Previous Article in Journal
A New Oren–Nayar Shape-from-Shading Approach for 3D Reconstruction Using High-Order Godunov-Based Scheme
Previous Article in Special Issue
Hybrid Flow Shop with Unrelated Machines, Setup Time, and Work in Progress Buffers for Bi-Objective Optimization of Tortilla Manufacturing
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(5), 76; https://doi.org/10.3390/a11050076

PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters

1
Moscow Institute of Physics and Technology, Moscow 141701, Russia
2
Computer Science Department, CICESE Research Center, 22860 Ensenada, Baja California, Mexico
3
School of Electrical Engineering and Computer Science, South Ural State University, Chelyabinsk 454080, Russia
*
Author to whom correspondence should be addressed.
Received: 27 February 2018 / Revised: 9 April 2018 / Accepted: 9 April 2018 / Published: 22 May 2018
(This article belongs to the Special Issue Algorithms for Scheduling Problems)
View Full-Text   |   Download PDF [2000 KB, uploaded 22 May 2018]   |  

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. View Full-Text
Keywords: DSP microprocessor; multicore; multiprocessors; scheduling; workflow; resource management; job allocation DSP microprocessor; multicore; multiprocessors; scheduling; workflow; resource management; job allocation
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Drozdov, A.Y.; Tchernykh, A.; Novikov, S.V.; Vladislavlev, V.E.; Rivera-Rodriguez, R. PHEFT: Pessimistic Image Processing Workflow Scheduling for DSP Clusters. Algorithms 2018, 11, 76.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top