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...
Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includesarchitectural options as well as workload...
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...
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...
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),...