Sciweavers

473 search results - page 55 / 95
» Early-release fair scheduling
Sort
View
TPDS
2008
175views more  TPDS 2008»
13 years 9 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...
RTSS
2002
IEEE
14 years 1 months ago
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
Samarjit Chakraborty, Simon Künzli, Lothar Th...
ADBIS
1997
Springer
246views Database» more  ADBIS 1997»
14 years 1 months 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...
GLOBECOM
2007
IEEE
14 years 3 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
INFOCOM
1998
IEEE
14 years 1 months 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...