This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling
December 1994 (vol. 43 no. 12)
pp. 1407-1412

Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemption. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with shared resources, but does not consider precedence constraints. This results in schedulability formulas for task sets which allow preemption, shared resources, and precedence constraints, and a practical algorithm for many real-time uniprocessor systems.

[1] T. P. Baker, "Stack-based scheduling of realtime processes,"J. Real-Time Syst., vol. 3, pp. 67-99, 1991.
[2] J. Blazewicz, "Scheduling dependent tasks with different arrival times to meet deadlines," inModeling and Performance Evaluation of Computer Systems. Amsterdam: North-Holland, 1976.
[3] M. Chen and K. Lin, "Dynamic priority ceilings: A concurrency control protocol for real-time systems,"J. Real-Time Syst., vol. 2, pp. 325-346, 1990.
[4] H. Chetto, M. Silly, and T. Bouchentouf, "Dynamic scheduling of real-time tasks under precedence constraints,"J. Real-Time Syst., vol. 2, pp. 181-194, 1990.
[5] M. L. Dertouzos, "Control robotics: The procedural control of physical processes,"Information Processing 74. Amsterdam, The Netherlands: North-Holland, 1974.
[6] M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, "Scheduling unit-time tasks with arbitrary release times and deadlines,"SIAM J. Comput., vol. 10, no. 2, pp. 256-269, May 1981.
[7] J. R. Jackson, "Scheduling a production line to minimize maximum tardiness," Res. Rep. 43, Management Sci. Res. Project, Univ. of California. Los Angeles, 1955.
[8] H. Kopetz, A. Damm. C. Koza, M. Mulazzani, W. Schwabl, C. Senft, and R. Zainlinger. "Distributed fault-tolerant real-time systems: The Mars approach,"IEEE Micro., vol. 9, no. 1, pp. 25-40, Feb. 1989.
[9] H. Kopetz, R. Zainlinger, G. Fohler, H. Kantz, P. Puschner, and W. Schütz: "The design of real-time systems: From specification to implementation and verification,"Software Eng. J., vol. 6, no. 3, pp. 72-82, May 1991.
[10] E. L. Lawler, "Recent results in the theory of machine scheduling," inMathematical Programming: The State of the Art. A. Bachen et al., Eds. New York: Springer-Verlag, 1983.
[11] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[12] A. K. Mok, "Fundamental design problems of distributed systems for the hard-real-time environment," Ph.D. thesis, Dep. of Elec. Eng. and Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, May 1983.
[13] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization,"IEEE Trans. Comput., vol. 39, no. 9, Sept. 1990.
[14] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.

Index Terms:
protocols; scheduling; precedence constraints integration; shared resources; real-time scheduling; unit time tasks; EDF-like schedulers; protocol; precedence constraints; real-time uniprocessor systems.
Citation:
M. Spuri, J.A. Stankovic, "How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling," IEEE Transactions on Computers, vol. 43, no. 12, pp. 1407-1412, Dec. 1994, doi:10.1109/12.338100
Usage of this product signifies your acceptance of the Terms of Use.