Handling precedence constraints with neural network based real-time scheduling algorithms

Author(s):  
Carlos Cardeira ◽  
Miguel P. Silva ◽  
Zoubir Mammeri
2021 ◽  
Vol 23 (06) ◽  
pp. 1318-1329
Author(s):  
M. Sreenath ◽  
◽  
Dr. P. A. Vijaya ◽  

The scheduling algorithms have been examined by the process of task execution in a system to achieve maximum utilization of multiprocessors. Consequently, the research attempted to propose a new real-time scheduling algorithm to support a multiprocessor platform. The proposed scheduling algorithm, List Mcnaughton’s amalgamation (LiMca) scheduling algorithm has been developed for an optimum solution with the features of List and Mcnaughton’s scheduling algorithms to overcome the individual drawbacks (pre-emption and Precedence constraints). In LiMca, Workload has been distributed to the processors in a system by sorting the tasks in decreasing order with their precedence constraints including due dates, pre-emption, and context switching. In this arena, the LiMca scheduling algorithm has been developed on a traditional avionic mission system and also simulated on a real-time application. The extensive simulations were carried out on the time optimization of resources scheduling (TORSCHE) simulation toolbox. LiMca scheduling algorithm performed superior as compared to recently reported scheduling algorithms like list, hu’s, McNaughton’s, Brucker’s, and Hodgson’s in terms of computational performance.


1990 ◽  
Vol 28 (1-5) ◽  
pp. 211-216 ◽  
Author(s):  
R. Cobelli ◽  
L. Mezzalira ◽  
G.F. Navoni ◽  
N. Scarabottolo

Sign in / Sign up

Export Citation Format

Share Document