APPLICATION OF REAL-TIME FAN SCHEDULING IN EXPLORATION-EXPLOITATION TO OPTIMIZE MINIMUM FUNCTION OBJECTIVES

• Published in: Applied Computer Science (Lublin) Vol. 19; no. 2; pp. 43 - 54
• Main Authors: Mariano LARIOS-GÓMEZ, Perfecto M. QUINTERO-FLORES, Mario ANZURES-GARCÍA
• Format: Journal Article
• Language: English
• Published: Polish Association for Knowledge Promotion 01.06.2023
• Subjects: concurrent computing; genetic algorithms; real-time task scheduling
• ISSN: 1895-3735; 2353-6977
• DOI: 10.35784/acs-2023-13

This paper presents the application of a task scheduling algorithm called Fan based on artificial intelligence technique such as genetic algorithms for the problem of finding minima in objective functions, where equations are predefined to measure the return on investment. This work combines the methodologies of population exploration and exploitation. Results with good aptitudes are obtained until a better learning based on non-termination conditions is found, until the individual provides a better predisposi¬tion, adhering to the established constraints, exhausting all possible options and satisfying the stopping condition. A real-time task planning algorithm was applied based on consensus techniques. A software tool was developed, and the scheduler called FAN was adapted that contemplates the execution of periodic, aperiodic, and sporadic tasks focused on controlled environments, considering that strict time restrictions are met. In the first phase of the work, it is shown how convergence precipitates to an evolution. This is done in a few iterations. In the second stage, exploitation was improved, giving the algorithm a better performance in convergence and feasibility. As a result, a population was used and iterations were applied with a fan algorithm and better predisposition was obtained, which occurs in asynchronous processes while scheduling in real time.