Sciweavers

155 search results - page 7 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
EUC
2004
Springer
15 years 3 months ago
Power-Aware Scheduling of Mixed Task Sets in Priority-Driven Systems
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
Dongkun Shin, Jihong Kim
LCN
2003
IEEE
15 years 2 months ago
Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures
Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different ...
Nzinga D. Kiameso, Hossam S. Hassanein, Hussein T....
96
Voted
RTSS
2007
IEEE
15 years 3 months ago
Analysis of Hierarchical EDF Pre-emptive Scheduling
This paper focuses on scheduling different hard real-time applications on a uniprocessor when the earliest deadline first algorithm is used as the local scheduler, and the global ...
Fengxiang Zhang, Alan Burns
IESS
2007
Springer
110views Hardware» more  IESS 2007»
15 years 3 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
RTSS
2007
IEEE
15 years 3 months ago
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao