RTS
1998
13 years 4 months ago
1998
When developing multitasking real-time systems, schedulability tests are used to formally prove that a given task set will meet its deadlines. A wide range of such tests have appe...
RTSS
2003
IEEE
13 years 10 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
RTSS
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
RTSS
2007
IEEE
13 years 11 months ago
2007
IEEE
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
Recently there has been considerable interest in incorporating timing effects of microarchitectural features of processors (e.g. caches and pipelines) into the schedulability anal...
EMSOFT
2009
Springer
13 years 11 months ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
ICPPW
2009
IEEE
13 years 11 months ago
2009
IEEE
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...