GRASP and Iterated Local Search-Based Cellular Processing algorithm for Precedence-Constraint Task List Scheduling on Heterogeneous Systems

• Main Authors: Alejandro Santiago, J. David Terán-Villanueva, Salvador Ibarra Martínez, José Antonio Castán Rocha, Julio Laria Menchaca, Mayra Guadalupe Treviño Berrones, Mirna Ponce-Flores
• Format: Article
• Language: English
• Published: MDPI AG 2020-10-01
• Series: Applied Sciences
• Subjects: cellular processing algorithms; processing cell; iterated local search; GRASP; scheduling; makespan
• Online Access: https://www.mdpi.com/2076-3417/10/21/7500

High-Performance Computing systems rely on the software’s capability to be highly parallelized in individual computing tasks. However, even with a high parallelization level, poor scheduling can lead to long runtimes; this scheduling is in itself an NP-hard problem. Therefore, it is our interest to use a heuristic approach, particularly Cellular Processing Algorithms (CPA), which is a novel metaheuristic framework for optimization. This framework has its foundation in exploring the search space by multiple Processing Cells that communicate to exploit the search and in the individual stagnation detection mechanism in the Processing Cells. In this paper, we proposed using a Greedy Randomized Adaptive Search Procedure (GRASP) to look for promising task execution orders; later, a CPA formed with Iterated Local Search (ILS) Processing Cells is used for the optimization. We assess our approach with a high-performance ILS state-of-the-art approach. Experimental results show that the CPA outperforms the previous ILS in real applications and synthetic instances.