Sciweavers

137 search results - page 7 / 28
» General Perfectly Periodic Scheduling
Sort
View
PRDC
2006
IEEE
14 years 1 months ago
Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
Hakem Beitollahi, Geert Deconinck
RTSS
1999
IEEE
13 years 11 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
ICMAS
1998
13 years 8 months ago
Poaching and Distraction in Asynchronous Agent Activities
We investigate coordination issues in a distributed jobshop scheduling system in which agents schedulepotentially contentious activities asynchronously in parallel. Agents in such...
Mike H. Chia, Daniel E. Neiman, Victor R. Lesser
26
Voted
SOSP
2001
ACM
14 years 4 months ago
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O
Disk schedulers in current operating systems are generally work-conserving, i.e., they schedule a request as soon as the previous request has finished. Such schedulers often requ...
Sitaram Iyer, Peter Druschel
DATE
2007
IEEE
128views Hardware» more  DATE 2007»
14 years 1 months ago
Accounting for cache-related preemption delay in dynamic priority schedulability analysis
Recently there has been considerable interest in incorporating timing effects of microarchitectural features of processors (e.g. caches and pipelines) into the schedulability anal...
Lei Ju, Samarjit Chakraborty, Abhik Roychoudhury