Sciweavers

1502 search results - page 5 / 301
» Node weighted scheduling
Sort
View
PDCAT
2005
Springer
14 years 3 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
14 years 2 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis
RTSS
2007
IEEE
14 years 4 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