Preemptive scheduling under time and resource constraints
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Instruction level timing mechanisms for accurate real-time task scheduling
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Load sharing in soft real-time distributed computer systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Application note: Knowledge-based architecture for a personal ISDN workstation
Computer Communications
A single server queue in a hard-real-time environment
Operations Research Letters
Deadline prediction scheduling based on benefits
Future Generation Computer Systems
| Hi-index | 0.00 |
This paper describes a scheduling algorithm for a set of tasks that guarantees the time within which a task, once started, will complete. A task is started upon receipt of an external signal or the completion of other tasks. Each task has a rxed set of requirements in processor time, resources, and device operations needed for completion of its various segments. A worst case analysis of task performance is carried out. An algorithm is developed for determining the response times that can be guaranteed for a set of tasks. Operating system overhead is also accounted for.