Sciweavers

472 search results - page 74 / 95
» Quick-release Fair Scheduling
Sort
View
TPDS
2008
175views more  TPDS 2008»
13 years 8 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
ADBIS
1997
Springer
246views Database» more  ADBIS 1997»
14 years 27 days ago
Concurrency Control in Distributed Object-Oriented Database Systems
Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includesarchitectural options as well as workload...
Kjetil Nørvåg, Olav Sandstå, Kj...
INFOCOM
1998
IEEE
14 years 29 days ago
On Adaptive Bandwidth Sharing with Rate Guarantees
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
Nick G. Duffield, T. V. Lakshman, Dimitrios Stilia...
MASCOTS
2004
13 years 10 months ago
Simulation Evaluation of Hybrid SRPT Scheduling Policies
This paper uses trace-driven simulations to evaluate two novel Web server scheduling policies called KSRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (Shortest Remaini...
Mingwei Gong, Carey L. Williamson
COMCOM
2010
112views more  COMCOM 2010»
13 years 8 months ago
Birkhoff-von Neumann switching with statistical traffic profiles
Offline scheduling is attractive when the traffic profile is known a priori since the complexity of online scheduling is largely removed. Given any admissible rate matrix = (ij),...
Jerry Chi-Yuan Chou, Bill Lin