Sciweavers

119 search results - page 2 / 24
» An Analysis of Fixed-Priority Schedulability on a Multiproce...
Sort
View
RTAS
2011
IEEE
12 years 9 months ago
FPZL Schedulability Analysis
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
Robert I. Davis, Alan Burns
ETFA
2006
IEEE
13 years 11 months ago
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
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...
Liliana Cucu, Joël Goossens
RTAS
2009
IEEE
14 years 15 days ago
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
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...
Shinpei Kato, Nobuyuki Yamasaki
RTS
2011
123views more  RTS 2011»
13 years 21 days ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
RTSS
2005
IEEE
13 years 11 months ago
Hierarchical Fixed Priority Pre-Emptive Scheduling
This paper focuses on the hierarchical scheduling of systems where a number of separate applications reside on a single processor. It addresses the particular case where fixed pri...
Robert I. Davis, Alan Burns