A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling
Citations Over TimeTop 10% of 2020 papers
Abstract
The multiprocessor task scheduling problem has received considerable attention over the last three decades. In this context, a wide range of studies focuses on the design of evolutionary algorithms. These papers deal with many topics, such as task characteristics, environmental heterogeneity, and optimization criteria. To classify the academic production in this research field, we present here a systematic literature review for the directed acyclic graph (DAG) scheduling, that is, when tasks are modeled through a directed acyclic graph. Based on the survey of 56 works, we provide a panorama about the last 30 years of research in this field. From the analyzes of the selected studies, we found a diversity of application domains and mapped their main contributions.
Related Papers
- → Scheduling multiprocessor tasks — An overview(1996)237 cited
- Finding cyclic behavior in multiprocessor real-time scheduling(2006)
- → Algorithms for Scheduling Inhomogeneous Multiprocessor Computers(1984)
- Multiprocessor-job Scheduling on Network Parallel System(2003)
- → Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors(1997)