Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Fault-Tolerant Software for Real-Time Applications
ACM Computing Surveys (CSUR)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems.
Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems.
Cluster Computing
Improving fixed priority schedulability with dynamic priority as secondary criterion
Journal of Embedded Computing - Best Papers of RTS' 2005
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
Hi-index | 0.00 |
Real-time multiprogramming systems, in which a hardware processor is dynamically assigned to run multiple software processes each designed to control an important device (user), are considered. Each software process executes a task in response to a service request repeatedly coming from the corresponding user. Each service task is associated with a strict deadline, and thus the design problem that we are concerned with is to ensure that the service tasks requested can always be executed within the associated deadlines, i.e., no task overrun occurs. This problem was studied by several investigators for the cases where preemptive scheduling strategies are used. In contrast, very few studies have been conducted for cases of non-preemptive scheduling. In this paper we show that a non-preemptive strategy, called relative urgency non-preemptive (RUNP) strategy, is optimal in the sense that if a system runs without a task overrun under any non-preemptive strategy, it will also run without a task overrun under the RUNP strategy. Then an efficient procedure used at the design time for detecting the possibility of a task overrun in a system using the RUNP strategy is presented. The procedure is useful in designing overrun-free real-time multiprogramming systems that yield high processor utilizations. Some special types of systems using the RUNP strategy for which even simpler detection procedures are available are also discussed.