66 search results - page 2 / 14 » Multiprocessor EDF and Deadline Monotonic Schedulability Ana... |
IPPS
1997
IEEE
14 years 3 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
ECRTS
2003
IEEE
14 years 4 months ago
2003
IEEE
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design o...
ECRTS
2007
IEEE
14 years 5 months ago
2007
IEEE
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
RTSS
2007
IEEE
14 years 5 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 ...
RTS
2006
13 years 10 months ago
2006
A new feasibility test for preemptive scheduling of periodic or sporadic real-time tasks on a single-queue m-server system allows for arbitrary fixed task priorities and arbitrary...