Next Article in Journal
Evaluation of Color Change and Biodeterioration Resistance of Gewang (Corypha utan Lamk.) Wood
Next Article in Special Issue
DM: Dehghani Method for Modifying Optimization Algorithms
Previous Article in Journal
Usability Evaluation for the Integration of Library Data Analysis and an Interactive Artwork by Sensing Technology
Previous Article in Special Issue
Scheduling in Heterogeneous Distributed Computing Systems Based on Internal Structure of Parallel Tasks Graphs with Meta-Heuristics
Open AccessArticle

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

1
Information Technology Engineering, Polytechnic University of Altamira, Altamira 89602, Mexico
2
Facultad de Ingeniería, Universidad Autónoma de Tamaulipas, Tampico 89339, Mexico
3
Graduate Program Division, Tecnológico Nacional de México/Instituto Tecnológico de Ciudad Madero, Cd. Madero 89440, Mexico
*
Author to whom correspondence should be addressed.
Appl. Sci. 2020, 10(21), 7500; https://doi.org/10.3390/app10217500
Received: 28 September 2020 / Revised: 18 October 2020 / Accepted: 19 October 2020 / Published: 25 October 2020
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. View Full-Text
Keywords: cellular processing algorithms; processing cell; iterated local search; GRASP; scheduling; makespan; HPC (High-Performance Computing); DAG (Directed Acyclic Graph) cellular processing algorithms; processing cell; iterated local search; GRASP; scheduling; makespan; HPC (High-Performance Computing); DAG (Directed Acyclic Graph)
Show Figures

Figure 1

MDPI and ACS Style

Santiago, A.; Terán-Villanueva, J.D.; Martínez, S.I.; Rocha, J.A.C.; Menchaca, J.L.; Berrones, M.G.T.; Ponce-Flores, M. GRASP and Iterated Local Search-Based Cellular Processing algorithm for Precedence-Constraint Task List Scheduling on Heterogeneous Systems. Appl. Sci. 2020, 10, 7500.

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.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop