Sciweavers

472 search results - page 31 / 95
» Quick-release Fair Scheduling
Sort
View
IAJIT
2010
124views more  IAJIT 2010»
13 years 7 months ago
Uplink Downlink Limited Round Robin Scheduling Algorithms
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
Rawya Rizk
INFOCOM
2010
IEEE
13 years 7 months ago
Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
Zhe Yang, Lin Cai, Wu-sheng Lu
OSDI
2000
ACM
13 years 10 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...
HICSS
2006
IEEE
134views Biometrics» more  HICSS 2006»
14 years 2 months ago
Differentiated Priority Scheduling and Adaptive Segmentation for Bluetooth Piconets
Bluetooth is a wireless communication technology, aimed at supporting connectivity among close proximity mobile devices. Bluetooth enables the design of low-power, low-cost, and s...
Jyothsna Kalvala, Gergely V. Záruba
CSFW
2002
IEEE
14 years 1 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...