Sciweavers

437 search results - page 17 / 88
» Quincy: fair scheduling for distributed computing clusters
Sort
View
PERCOM
2003
ACM
15 years 11 months ago
Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth...
Samarth H. Shah, Kai Chen, Klara Nahrstedt
IPPS
2007
IEEE
15 years 6 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang
NETWORKING
2004
15 years 1 months ago
Performance of Wireless Ad Hoc Networks under Balanced Fairness
Balanced fairness is a new resource sharing concept recently introduced by Bonald and Prouti`ere. We extend the use of this notion to wireless networks where the link capacities at...
Aleksi Penttinen, Jorma T. Virtamo
CLUSTER
2001
IEEE
15 years 3 months ago
A Class of Loop Self-Scheduling for Heterogeneous Clusters
Distributed Computing Systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is...
Anthony T. Chronopoulos, Manuel Benche, Daniel Gro...
HPDC
1998
IEEE
15 years 4 months ago
Towards a Hierarchical Scheduling System for Distributed WWW Server Clusters
In this paper we present a model for dynamically scheduling HTTP requests across clusters of servers, optimizing the use of client resources as well as the scattered server nodes....
Daniel Andresen, Timothy McCune