Sciweavers

1536 search results - page 114 / 308
» DPS - Dynamic Parallel Schedules
Sort
View
125
Voted
IPPS
2007
IEEE
15 years 9 months ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks
In this paper we augment DLT (Divisible Load Theory) with incentives such that it is beneficial for processors to report their true processing capacity and compute their assignme...
Thomas E. Carroll, Daniel Grosu
IPPS
2006
IEEE
15 years 9 months ago
Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed systems
A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the n...
Santiago Urueña, Juan Zamorano, Daniel Berj...
139
Voted
JSSPP
2001
Springer
15 years 7 months ago
SRPT Scheduling for Web Servers
This note briefly summarizes some results from two papers: [4] and [23]. These papers pose the following question: Is it possible to reduce the expected response time of every req...
Mor Harchol-Balter, Nikhil Bansal, Bianca Schroede...
136
Voted
COCOA
2008
Springer
15 years 5 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
NETWORKING
2007
15 years 4 months ago
Beyond Proportional Fair: Designing Robust Wireless Schedulers
Abstract. Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve “well-behaved” users in practice. One of the main cau...
Soshant Bali, Sridhar Machiraju, Hui Zang