Abstract:
Within the hard real-time community, static priority pre-emptive scheduling is receiving increased attention. Current optimal priority assignment schemes require that at some point in the system lifetime all tasks must be released simultaneously. Two main optimal priority assignment schemes have been proposed: rate-monotonic, where task period equals deadline, and deadlinemonotonic where task deadline maybe less than period. When tasks are permitted to have arbitrary start times, a common release time between all tasks in a task set may not occur. In this eventuality, both rate-monotonic and deadline-monotonic priority assignments cease to be optimal. This paper presents an method of determining if the tasks with arbitrary release times will ever share a common release time. This has complexity O(m log e m) in the longest task period. Also, an optimal priority assignment method is given, of complexity O(n 2 + n) in the number of tasks. Finally, an efficient feasibility test is presented, for those task sets whose tasks do not share a common release time.
Citations
|
2168
|
Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
– Liu, Layland
- 1973
|
|
439
|
The rate monotonic scheduling algorithm-Exact characterization and average case behavior
– Lehoczky, Sha, et al.
- 1989
|
|
239
|
On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks, Performance Evaluation 2
– Leung, Whitehead
- 1982
|
|
202
|
Finding response times in a real-time system
– Joseph, Pandya
- 1986
|
|
167
|
The Art of Computer Programming, Vol. 1: Fundamental Algorithms
– KNUTH
- 1968
|
|
158
|
Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines
– Lehoczky
- 1990
|
|
76
|
A note on preemptive scheduling of periodic, real time tasks
– Leung, Merrill
- 1980
|
|
43
|
Hard Real-Time Scheduling: The Deadline Monotonic Approach
– Audsley, Burns, et al.
- 1991
|
|
35
|
STRESS: A simulator for hard real-time systems
– Audsley, Burns, et al.
- 1994
|
|
27
|
A new algorithm for scheduling periodic, real-time tasks
– Leung
- 1989
|
|
25
|
Deadline Monotonic Scheduling
– Audsley
- 1990
|
|
3
|
Elementary Number Theory and its Applications, Addison-Wesley
– Rosen
- 1988
|
|
2
|
Hard Real-Time Sporadic Task Scheduling for Fixed Priority Schedulers
– Nassor, Bres
- 1991
|
