Sciweavers

10 search results - page 1 / 2
» Utilization-Bound Based Schedulability Analysis of Weighted ...
Sort
View
RTSS
2007
IEEE
13 years 10 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
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 4 months ago
A Markov Chain Model for the Analysis of Round-Robin Scheduling Scheme
---------------------------------------------------ABSTRACT-----------------------------------------------In the literature of Round-Robin scheduling scheme, each job is processed,...
D. Shukla, Saurabh Jain, Rahul Singhai, R. K. Agar...
CODES
2007
IEEE
13 years 11 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
ANCS
2005
ACM
13 years 10 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
INFOCOM
1996
IEEE
13 years 8 months ago
Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
Dimitrios Stiliadis, Anujan Varma