Sciweavers

215 search results - page 37 / 43
» Earliest Deadline Scheduling for Real-Time Database Systems
Sort
View
RTAS
2009
IEEE
14 years 2 months 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
CODES
2008
IEEE
13 years 9 months ago
Guaranteed scheduling for repetitive hard real-time tasks under the maximal temperature constraint
We study the problem of scheduling repetitive real-time tasks with the Earliest Deadline First (EDF) policy that can guarantee the given maximal temperature constraint. We show th...
Gang Quan, Yan Zhang, William Wiles, Pei Pei
RTAS
2005
IEEE
14 years 29 days ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
RTSS
2008
IEEE
14 years 1 months ago
Control-Driven Tasks: Modeling and Analysis
The standard design of control systems is based on the periodic sampling. Every period the data is read from the input, the control law is computed, and the output is written to t...
Manel Velasco, Pau Martí, Enrico Bini
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...