Abstract
The basic problem in real-time research is how to model a real-time application. In this paper we look at the modeling itself. A real-time task is defined as a sequence of execution requirements with deadlines. The feasibility difficulties of different models are analysed. It turns out generalizing the conventional model does not increase the complextiy level of feasibility testing while it gives us more flexibility to model real-time problems. Adding start time to a task model increases the chance of feasibility but at the same time raises the complexity level into co-NP-complete in the strong sense.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Baruah, S.K., Chen, D., Gorinsky, S., Mok, A.K.: Generalized Multiframe Tasks. To appear in Real-Time Systems Journal
Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility Problems for Recurring Tasks on One Processor. Theoretical Computer Science. 118(1) (1993) 3–20
Baruah, S.K., Mok, A.K., Rosier, L.E.: Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor IEEE Real-Time Systems Symposium. December (1991)
Burns, A., Wellings, A.J.: Dual Priority Assignment: A Practical Method for Increasing Processor Utilization. Fifth Euromicro Workshop on Real-Time Systems. Oulu. (1993) 48–55
Chen, D., Baruah, S.K., Mok, A.K., Gorinsky, S.: Synchronous Multiframe Tasks. To be submitted. (1997)
Chetto, H., Chetto, M.: Some Results of the Earliest Deadline Scheduling Algorithm. IEEE Transactions on Software Engineering. 15(10) (1989)
Dertouzos, M.: Control Robotics: The Procedural Control of Physical Processes. Proceedings of the IFIP Congress. (1974) 807–813
Han, C.C., Lin, K.J.: Scheduling Distance-constraint Real-time Tasks. IEEE Real-Time Systems Symposium. December (1992) 814–826
Harbour, M.G., Klein, M.H., Lehoczky, J.P.: Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems. IEEE Transaction on Software Engineering. 20(1) (1994) 13–28
Lehoczky, J.P.: Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines. IEEE Real-Time Systems Symposium. December (1990)
Lehoczky, J.P., Sha, L., Ding, Y.: The Rate Monotonic Scheduling Algorithm-Exact Characterization and Average Case Behavior. IEEE Real-Time Systems Symposium. December (1989)
Leung, J.Y.T., Whitehead, J.: On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks. Performance Evaluation. 2 (1982) 237–250
Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Journal of ACM. 20(1) (1973)
Mok, A.K.: Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment. Ph.D. thesis. MIT. (1983)
Mok, A.K., Chen, D.: A Multiframe Model for Real-Time Tasks. IEEE Real-Time Systems Symposium. December (1996)
Ripoll, I., Crespo, A., Mok, A.K.: Improvement in Feasibility Testing for Real-Time Tasks. Real-Time Systems. 11 (1996) 19–39
Sha, L., Goodenough, J.B.: Real-Time Scheduling Theory and Ada. IEEE Computer. 23(4) (1990) 53–62
Sprunt, B., Sha, L., Lehoczky, J.P.: Aperiodic Task Scheduling for Hard Real-Time Systems. Real-Time Systems: The International Journal of Time-Critical Computing Systems. 1 (1989) 27–60
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chen, D., Mok, A., Baruah, S. (1998). On modeling real-time task systems. In: Rozenberg, G., Vaandrager, F.W. (eds) Lectures on Embedded Systems. EEF School 1996. Lecture Notes in Computer Science, vol 1494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-65193-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-65193-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65193-2
Online ISBN: 978-3-540-49498-0
eBook Packages: Springer Book Archive