155 search results - page 11 / 31 » On Schedulability Bounds of Static Priority Schedulers |
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
101
click to vote
OPODIS
2007
14 years 11 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
EMSOFT
2004
Springer
15 years 3 months ago
2004
Springer
Cache prediction for preemptive scheduling is an open issue despite its practical importance. First analysis approaches use simplified models for cache behavior or they assume si...
RTAS
2008
IEEE
15 years 4 months ago
2008
IEEE
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...