Sciweavers

1257 search results - page 107 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
CLUSTER
2006
IEEE
15 years 7 months ago
Stochastic Scheduling with Availability Constraints in Heterogeneous Clusters
High availability plays an important role in heterogeneous clusters, where processors operate at different speeds and are not continuously available for processing. Existing sched...
Tao Xie 0004, Xiao Qin
IPPS
2007
IEEE
15 years 8 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
INFOCOM
1998
IEEE
15 years 6 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
EUROPAR
2007
Springer
15 years 7 months ago
Cooperation in Multi-organization Scheduling
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
Fanny Pascual, Krzysztof Rzadca, Denis Trystram
GCC
2004
Springer
15 years 7 months ago
Hybrid Performance-Oriented Scheduling of Moldable Jobs with QoS Demands in Multiclusters and Grids
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, X...