Sciweavers

4081 search results - page 40 / 817
» Scheduling in polling systems
Sort
View
RTAS
2005
IEEE
14 years 1 months 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
SIGMETRICS
2012
ACM
251views Hardware» more  SIGMETRICS 2012»
11 years 10 months ago
Providing fairness on shared-memory multiprocessors via process scheduling
Competition for shared memory resources on multiprocessors is the most dominant cause for slowing down applications and makes their performance varies unpredictably. It exacerbate...
Di Xu, Chenggang Wu, Pen-Chung Yew, Jianjun Li, Zh...
ECRTS
2006
IEEE
14 years 1 months ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson
RTCSA
2007
IEEE
14 years 1 months ago
Real-Time Scheduling with Task Splitting on Multiprocessors
This paper presents a real-time scheduling algorithm with high schedulability and few preemptions for multiprocessor systems. The algorithm is based on an unorthodox method called...
Shinpei Kato, Nobuyuki Yamasaki
ISORC
2002
IEEE
14 years 18 days ago
Handling Aperiodic Tasks in Diverse Real-Time Systems via Plug-Ins
Functionality for various services of scheduling algorithms is typically provided as extensions to a basic algorithm. Aperiodic task handling, guarantees, etc., are integrated wit...
Tomas Lennvall, Gerhard Fohler, Björn Lindber...