155 search results - page 1 / 31 » On Schedulability Bounds of Static Priority Schedulers |
RTAS
2005
IEEE
13 years 10 months ago
2005
IEEE
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
ECRTS
2006
IEEE
13 years 10 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
LCTRTS
1995
Springer
13 years 8 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
PE
2006
Springer
13 years 4 months ago
2006
Springer
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...
RTAS
2006
IEEE
13 years 10 months ago
2006
IEEE
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...