Sciweavers

472 search results - page 38 / 95
» Quick-release Fair Scheduling
Sort
View
RTSS
2002
IEEE
14 years 1 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
TON
2010
176views more  TON 2010»
13 years 3 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
GLOBECOM
2007
IEEE
14 years 3 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
TMC
2008
179views more  TMC 2008»
13 years 8 months ago
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and medium access control (MAC)-layer scheduling on wireless links. We consider a wireless network with mult...
Lachlan L. H. Andrew, Stephen V. Hanly, Rami G. Mu...
ANOR
2008
96views more  ANOR 2008»
13 years 9 months ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual