Sciweavers

229 search results - page 4 / 46
» A Case for Priority
Sort
View
RTSS
2005
IEEE
15 years 5 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
FMSD
2007
133views more  FMSD 2007»
14 years 11 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
AMMA
2009
Springer
15 years 6 months ago
School Choice: The Case for the Boston Mechanism
I study school assignment problems, focusing on two popular mechanisms: the Boston Mechanism (BM) and Deferred Acceptance (DA). The former has been criticized regarding both e¢ c...
Antonio Miralles
RTS
2006
138views more  RTS 2006»
14 years 11 months ago
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
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...
Theodore P. Baker
RTCSA
2009
IEEE
15 years 6 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna