Abstract
In many hard real-time systems, due to the strict deadlines that must be met, communications among jobs are implemented in a completely deterministic manner. One approach used is to model communication requirements as precedence constraints among jobs, that is, if a job J i has to communicate the result of its computation to another job J j , the pair (J i , J j ) is introduced in a partial order ≺, and the jobs are scheduled in such a way that if J i ≺ J j the execution of J i precedes the execution of J j .
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T.P. Baker, “Stack-Based Scheduling of Real-Time Processes,” The Journal of Real-Time Systems 3, 1991.
J. Blazewicz, “Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines,” in E. Gelenbe, H. Bellner (eds), Modeling and Performance Evaluation of Computer Systems, North-Holland, Amsterdam, 1976.
M. Chen and K. Lin, “Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time Systems,” The Journal of Real-Time Systems 2, 1990.
H. Chetto, M. Silly, and T. Bouchentouf, “Dynamic Scheduling of Real-Time Tasks under Precedence Constraints,” The Journal of Real-Time Systems 2, 1990.
M.R. Garey, D.S. Johnson, B.B. Simons, and R.E. Tarjan, “Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines,” SIAM Journal on Computing 10(2), 1981.
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 9(1), 1989.
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 Engineering Journal 6(3), 1991.
A.K. Mok, “Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment,” Ph.D. Dissertation, MIT, 1983.
L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” IEEE Transactions on Computers 39(9), 1990.
M. Spuri and J.A. Stankovic, “How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling,” IEEE Transactions on Computers, Dec. 1994.
W. Zhao, K. Ramamritham, and J.A. Stankovic, “Scheduling Tasks with Resource Requirements in Hard Real-Time Systems,” IEEE Transactions on Software Engineering 12(5), 1987.
G. Zlokapa, Real-time Systems: Well-timed Scheduling and Scheduling with Precedence Constraints, Ph.D. Thesis, University of Massachusetts, February 1993.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stankovic, J.A., Spuri, M., Ramamritham, K., Buttazzo, G.C. (1998). Precedence Constraints and Shared Resources. In: Deadline Scheduling for Real-Time Systems. The Springer International Series in Engineering and Computer Science, vol 460. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5535-3_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5535-3_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7530-2
Online ISBN: 978-1-4615-5535-3
eBook Packages: Springer Book Archive