22 search results - page 1 / 5 » Feasibility intervals for multiprocessor fixed-priority sche... |
RTS
2006
13 years 4 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...
ETFA
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are wellknown for uni...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms. We first show two very general properties ...
RTSS
2009
IEEE
13 years 11 months ago
2009
IEEE
Recently, there have been several promising techniques developed for schedulability analysis and response time analysis for multiprocessor systems based on over-approximation. Thi...
RTAS
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper presents a new algorithm for fixed-priority scheduling of sporadic task systems on multiprocessors. The algorithm is categorized to such a scheduling class that quali...