Optimal Real-Time Scheduling with Minimal Rejections and Minimal Finishing Time

Real-timecomputer systems are essential for many applications, such asrobot control, avionics, medical instrumentation, manufacturing,etc. The correctness of the system depends on the temporal correctnessas well as the functional correctness of the task executions.In order to assure temporal correctness it is necessary thatthe resources be scheduled to meet the temporal requirementsof applications. When we consider the problem of nonpreemptivescheduling of a set of tasks in a processor for which no feasiblesolution exists, some tasks may have to be rejected so that aschedule can be generated for the rest. In this paper, we considerthe problem of generating an optimal schedule such that the numberof rejected tasks is minimized, and then the finish time is minimizedfor the accepted tasks. We propose to use an analytic approachto solve this problem. We first discuss the super sequence basedtechnique which was originally proposed for reducing the searchspace in testing the feasibility of a task set. Then we showby the Conformation theorem that the super sequence constructedfrom the task set also provides a valid and reduced search spacefor the optimization problem. While the complexity of our schedulingalgorithm in the worst case remains exponential, our simulationresults show that the cost is reasonable for the average case.

[1]  J. Erschler,et al.  A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates , 1983, Oper. Res..

[2]  M. Saksena,et al.  Temporal analysis for hard real-time scheduling , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[3]  Hermann Kopetz,et al.  Distributed fault-tolerant real-time systems: the Mars approach , 1989, IEEE Micro.

[4]  Jean-Philippe Babau,et al.  Extension of scheduling algorithms in case of conditional or parametric synchronisation relationships , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[5]  Shyh-In Hwang,et al.  Scheduling an overloaded real-time system , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[6]  Manas Saksena,et al.  A decomposition approach to non-preemptive real-time scheduling , 2005, Real-Time Systems.

[7]  Kishor S. Trivedi,et al.  Transient overloads in fault-tolerant real-time systems , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[8]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[9]  Satish K. Tripathi,et al.  The MARUTI hard real-time operating system , 1989, [1989] Proceedings. The Fourth Israel Conference on Computer Systems and Software Engineering.

[10]  Shyh-In Hwang,et al.  Optimization in non-preemptive scheduling for aperiodic tasks , 1994 .

[11]  Jane W.-S. Liu,et al.  Greed in resource scheduling , 2005, Acta Informatica.

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

[13]  Shyh-In Hwang,et al.  Mission-oriented replication of periodic tasks in real-time distributed systems , 1994 .

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

[15]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[16]  Lichen Zhang,et al.  Scheduling algorithms for multiprocessor real-time systems , 1997, Proceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat..

[17]  Shyh-In Hwang,et al.  Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms , 2001, J. Comb. Optim..

[18]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[19]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .