Sciweavers

1209 search results - page 21 / 242
» Effective bandwidths with priorities
Sort
View
RTS
2011
123views more  RTS 2011»
13 years 2 months 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
RTCSA
2009
IEEE
14 years 2 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
RTCSA
2008
IEEE
14 years 2 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
OTM
2007
Springer
14 years 1 months ago
A Semantic Framework for Priority-Based Service Matching in Pervasive Environments
The increasing popularity of personal wireless devices has raised new demands for the efficient discovery of heterogeneous devices and services in pervasive environments. The exis...
Ayomi Bandara, Terry R. Payne, David De Roure, Tim...
SIGMETRICS
2002
ACM
130views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Multiple-queue backfilling scheduling with priorities and reservations for parallel systems
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
Barry G. Lawson, Evgenia Smirni