Sciweavers

239 search results - page 45 / 48
» On-line scheduling of parallel jobs on two machines
Sort
View
JCO
2010
70views more  JCO 2010»
13 years 6 months ago
Worst-case analysis for on-line service policies
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
Zhenbo Wang, Wenxun Xing
IPPS
2006
IEEE
14 years 1 months ago
Aligning traces for performance evaluation
For many performance analysis problems, the ability to reason across traces is invaluable. However, due to non-determinism in the OS and virtual machines, even two identical runs ...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
GRID
2004
Springer
14 years 1 months ago
DiPerF: An Automated DIstributed PERformance Testing Framework
We present DiPerF, a distributed performance-testing framework, aimed at simplifying and automating service performance evaluation. DiPerF coordinates a pool of machines that test...
Catalin Dumitrescu, Ioan Raicu, Matei Ripeanu, Ian...
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
13 years 11 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli