Safe-state approach to real-time system scheduling
Technical Report
·
OSTI ID:7159571
This paper discusses nondeterministic scheduling for real-time systems serving a mix of tasks, some with deadlines to the beginning of service and some with deadlines to the completion of service. Some of the tasks may have, in addition to a deadline, some form or other of priorities associated with their execution. The authors propose treating all these cases uniformly by determining an estimated extinction time, defined as the latest time a task with a deadline and priority must begin its execution, and then to schedule the task according to some policy based upon its estimated extinction time.
- Research Organization:
- Purdue Univ., Lafayette, IN (USA). Dept. of Computer Science
- OSTI ID:
- 7159571
- Report Number(s):
- AD-A-217626/1/XAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Periodic real-time scheduling algorithms
Guaranteed deadlines for hard real-time fault-tolerant distributed systems
Scheduling sporadic and aperiodic events in a hard real-time system. Final report
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6935762
Guaranteed deadlines for hard real-time fault-tolerant distributed systems
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6037957
Scheduling sporadic and aperiodic events in a hard real-time system. Final report
Technical Report
·
Fri Mar 31 23:00:00 EST 1989
·
OSTI ID:5199185