Sciweavers

297 search results - page 45 / 60
» A non-preemptive scheduling algorithm for soft real-time sys...
Sort
View
RTCSA
2008
IEEE
15 years 4 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...
EUC
2008
Springer
14 years 11 months ago
Scheduling Aperiodic Tasks Using Total Bandwidth Server on Multiprocessors
This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two proble...
Shinpei Kato, Nobuyuki Yamasaki
SIGMETRICS
2003
ACM
101views Hardware» more  SIGMETRICS 2003»
15 years 2 months ago
Effects of clock resolution on the scheduling of interactive and soft real-time processes
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...
Yoav Etsion, Dan Tsafrir, Dror G. Feitelson
RTCSA
2007
IEEE
15 years 3 months ago
Fast Schedulability Analysis Using Commodity Graphics Hardware
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
Jimin Feng, Samarjit Chakraborty, Bertil Schmidt, ...
IANDC
2007
107views more  IANDC 2007»
14 years 9 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...