ACO approach with learning for preemptive scheduling of real-time tasks

This paper presents an ACO algorithm to search for feasible schedules of n real-time tasks on M identical processors. Unlike existing works, the proposed algorithm addresses the problem of preemptive scheduling rather than non-preemptive scheduling. A learning technique is integrated to detect and postpone possible preemptions between tasks. The proposed learning technique is also used to develop a necessary condition for the schedulability of the input task set. Experimental results show a significant success ratio improvement of the proposed scheduling algorithm.

[1]  Albert Mo Kim Cheng,et al.  Applying Ant Colony Optimization to the partitioned scheduling problem for heterogeneous multiprocessors , 2005, SIGBED Rev..

[2]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[3]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[4]  John A. Stankovic,et al.  Applicability of simulated annealing methods to real-time scheduling and jitter control , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[5]  Luca Maria Gambardella,et al.  A COOPERATIVE LEARNING APPROACH TO TSP , 1997 .

[6]  Seung-Min Yang,et al.  A Modified Least-Laxity-First scheduling algorithm for real-time tasks , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[7]  Ismael Ripoll,et al.  Hard real-time preemptively scheduling with high context switch cost , 1995, Proceedings Seventh Euromicro Workshop on Real-Time Systems.

[8]  Jörn Migge,et al.  Fine tuning the scheduling of tasks through a genetic algorithm: application to Posix1003.1b compliant systems , 2003, IEE Proc. Softw..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  David Lorge Parnas,et al.  Priority Scheduling Versus Pre-Run-Time Scheduling , 1998 .

[11]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[13]  Kang G. Shin,et al.  Combined Task and Message Scheduling in Distributed Real-Time Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[14]  Jia Xu,et al.  Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1993, IEEE Trans. Software Eng..

[15]  Fei Qiao,et al.  ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness , 2008, ANTS Conference.

[16]  J. Xu,et al.  Pre-run-time scheduling of processes with exclusion relations on nested or overlapping critical sections , 1992, Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings].

[17]  Alan Burns,et al.  Allocating hard real-time tasks: An NP-Hard problem made easy , 1992, Real-Time Systems.

[18]  D. Parnas,et al.  On satisfying timing constraints in hard-real-time systems , 1991, SIGSOFT '91.

[19]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[20]  Roman Nossal-Tüyeni.  An Evolutionary Approach to Multiprocessor Scheduling of Dependent Tasks , 1998, IPPS/SPDP Workshops.

[21]  Manas Saksena,et al.  Scheduling fixed-priority tasks with preemption threshold , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[22]  Habiba Drias,et al.  Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem , 2003, IWANN.

[23]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[24]  Roman Nossal,et al.  An evolutionary approach to multiprocessor scheduling of dependent tasks , 1998 .

[25]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[26]  Corso Elvezia.  Ant Colonies for the QAP , 1997 .

[27]  Giorgio Buttazzo.  Rate Monotonic vs. EDF: Judgment Day , 2003, EMSOFT.

[28]  T. Shepard,et al.  A Pre-Run-Time Scheduling Algorithm For Hard Real-Time Systems , 1991, IEEE Trans. Software Eng..