Sciweavers

Share
HIPC
2004
Springer

A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers

9 years 3 months ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize the execution time as a range-bound interval, say, [l, u], with l indicating the lower bound on the execution time and u indicating the upper bound on the same. Such intervals can be determined with a high degree of confidence in state of the art operating systems, such as MARUTI [7, 5] and MARS [2]. Secondly, jobs within a real-time system are often constrained by complex timing relationships. In hard real-time applications, it is vital that all such constraints are satisfied at run time, regardless of the values assumed by environment-dependent parameters, such as job execution times. As described in [11], there are two fundamental issues associated with real-time scheduling, viz., the schedulability query and dispatchability. A positive answer to the schedulability query may not by itself guarantee that ...
K. Subramani, Kiran Yellajyosula
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where HIPC
Authors K. Subramani, Kiran Yellajyosula
Comments (0)
books