A new performance measure for scheduling tasks in hard real-time systems is proposed and analyzed. The proposed measure is the maximum normalized task flowtime over all tasks, called the system hazard, where the normalized flowtime of a real-time task is the flowtime of the task divided by the period between its arrival time and deadline. The system hazard is a better measure than simply meeting task deadlines because it also indicates how early tasks as a whole can be completed before their deadlines. For a single processor with only independent periodic tasks, optimal scheduling algorithms with respect to the system hazard are derived for both static and dynamic cases. Two best bounds of processor utilization for these optimal algorithms ...
In hard real-time systems, gain time is defined as the difference between the Worst Case Execution T...
Scheduling algorithms are a governing part of real-time sys-tems and there exists many different sch...
Imprecise computation can reduce the proportion of tasks violating their time constraints in a hard ...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
On-line scheduling in real-time environments has been studied by a number of researchers [8, 16, 13,...
Abstract.This paper put forwards review on single processor scheduling algorithm to arrange periodic...
Imprecise computation and parallel processing are two techniques for avoiding timing faults and tole...
In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated t...
One way to minimizing resource requirements is through the careful management and allocation, in exa...
The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k pro...
The correctness of a real-time system depends on not only the running results but also on the time a...
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for h...
196 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.Allowing a real-time system t...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
In hard real-time systems, gain time is defined as the difference between the Worst Case Execution T...
Scheduling algorithms are a governing part of real-time sys-tems and there exists many different sch...
Imprecise computation can reduce the proportion of tasks violating their time constraints in a hard ...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
In this paper we study hard real-time systems: systems where strict time deadlines have to be met. ...
On-line scheduling in real-time environments has been studied by a number of researchers [8, 16, 13,...
Abstract.This paper put forwards review on single processor scheduling algorithm to arrange periodic...
Imprecise computation and parallel processing are two techniques for avoiding timing faults and tole...
In this paper, main scheduling algorithms for hard real-time systems (RTSs) have been investigated t...
One way to minimizing resource requirements is through the careful management and allocation, in exa...
The authors analyze the performance of a heuristic algorithm, Hk, which tries to keep at least k pro...
The correctness of a real-time system depends on not only the running results but also on the time a...
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for h...
196 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1999.Allowing a real-time system t...
In this paper we study hard real-time systems composed of periodic preemptive tasks and address the ...
In hard real-time systems, gain time is defined as the difference between the Worst Case Execution T...
Scheduling algorithms are a governing part of real-time sys-tems and there exists many different sch...
Imprecise computation can reduce the proportion of tasks violating their time constraints in a hard ...