Deadline-monotonic software scheduling for the co-synthesis of parallel hard real-time systems
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper focuses on software scheduling in hard real-time embedded systems. It uses the deadline-monotonic scheduling heuristics, where the analysis whether the hard real-time conditions are met, is done by a schedulability test. The test presented in this paper overcomes the problems of existing approaches with parallel communicating tasks. The essential of the test is, that the communication caused precedence constraints are mapped to minimum-maximum offset intervals, to deal with multiperiod systems, where fixed offset values are insufficient. By this method the deadlines and the offset intervals are computed automatically during the efficient analysis.Keywords
This publication has 8 references indexed in Scilit:
- Software scheduling in the co-synthesis of reactive real-time systemsPublished by Association for Computing Machinery (ACM) ,1994
- System Level DesignPublished by Springer Nature ,1993
- Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relationsIEEE Transactions on Software Engineering, 1993
- The End Of The Line For Static Cyclic Scheduling?Published by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Allocating hard real-time tasks: An NP-Hard problem made easyReal-Time Systems, 1992
- Scheduling processes with release times, deadlines, precedence and exclusion relationsIEEE Transactions on Software Engineering, 1990
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973