Sciweavers

794 search results - page 59 / 159
» Stackelberg scheduling strategies
Sort
View
CN
2006
93views more  CN 2006»
14 years 10 months ago
Revisiting unfairness in Web server scheduling
This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Ti...
Mingwei Gong, Carey L. Williamson
DAC
2009
ACM
15 years 11 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
IPPS
2007
IEEE
15 years 4 months ago
On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids
Abstract— We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to alloca...
Claris Castillo, George N. Rouskas, Khaled Harfous...
IPSN
2007
Springer
15 years 4 months ago
Power scheduling for wireless sensor and actuator networks
We previously presented a model for some wireless sensor and actuator network (WSAN) applications based on the vector space tools of frame theory. In this WSAN model there is a we...
Christopher J. Rozell, Don H. Johnson
INFOCOM
2003
IEEE
15 years 3 months ago
User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
Sem C. Borst