Sciweavers

Share
SIGCOMM
2012
ACM
7 years 9 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...
HPDC
2011
IEEE
8 years 10 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
8 years 10 months ago
Predicting completion times of batch query workloads using interaction-aware models and simulation
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
Mumtaz Ahmad, Songyun Duan, Ashraf Aboulnaga, Shiv...
WAOA
2010
Springer
237views Algorithms» more  WAOA 2010»
9 years 4 months ago
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
CLOUDCOM
2010
Springer
9 years 5 months ago
Bag-of-Tasks Scheduling under Budget Constraints
Commercial cloud offerings, such as Amazon's EC2, let users allocate compute resources on demand, charging based on reserved time intervals. While this gives great flexibilit...
Ana-Maria Oprescu, Thilo Kielmann
ANOR
2008
96views more  ANOR 2008»
9 years 7 months ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual
IPCO
1996
102views Optimization» more  IPCO 1996»
9 years 8 months ago
A Supermodular Relaxation for Scheduling with Release Dates
We consider the schedulingproblem ofminimizinga weighted sum of completion times under release dates. We present a relaxation which is a supermodular polyhedron. We show that this ...
Michel X. Goemans
ESA
1999
Springer
148views Algorithms» more  ESA 1999»
9 years 11 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
IROS
2006
IEEE
118views Robotics» more  IROS 2006»
10 years 1 months ago
Effects of Friction Parameters on Completion Times for Sustained Planar Positioning Tasks with a Haptic Interface
— Haptic interface devices and teleoperation masters are multiple degree of freedom devices manipulated by an operator to generate realtime motion commands to simulated environme...
Peter J. Berkelman, Ji Ma
IPPS
2009
IEEE
10 years 1 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
books