Voluntary Preemption: a Tool Tn The Design Of Hard Real-Time Systems

A new technique for scheduling hard real-time systems is proposed. We term this technique as voluntary preemption as it allows the user to determine the points at which the execution of a process can be preempted. There are several advantages of this technique. First of all, the internal structure of the processes can be used in determining the points where a process may be preempted. This permits, among other things, that critical sections are not preempted as well as identifying points at which a process should be preempted. Secondly, overhead cost of context switching can be taken into account realistically without sacrificing performance. Finally, since the overhead cost of context switching depends on the point (in the execution) where a process is preempted, this technique allows the preemption points to be chosen to reduce the overhead cost of context switching. These various considerations about where a process can be preempted, can be incorporated into an automatic tool to aid in the design of real-time systems.

[1]  Sheng Cheng,et al.  Scheduling algorithms for hard real-time systems: a brief survey , 1989 .

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

[3]  Sudarshan K. Dhall,et al.  An On Line Algorithm for Real-Time Tasks Allocation , 1986, IEEE Real-Time Systems Symposium.

[4]  L. Sha,et al.  The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks , 1988, IRTAW '88.

[5]  David Lorge Parnas,et al.  On synchronization in hard-real-time systems , 1988, CACM.

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

[7]  Abha Moitra,et al.  Scheduling of Hard Real-Time Systems , 1986, FSTTCS.

[8]  C. Wise,et al.  Public Service Configurations and Public Organizations: Public Organization Design in the Post-Privatization Era , 1990 .

[9]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

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

[11]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[12]  Krithi Ramamritham,et al.  Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems , 1985, IEEE Transactions on Computers.

[13]  David H. Jameson,et al.  A Real-Time Juggling Robot , 1986, RTSS.

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

[15]  Lui Sha,et al.  Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, RTSS.