Sciweavers

1125 search results - page 99 / 225
» On the job rotation problem
Sort
View
121
Voted
HPDC
2007
IEEE
15 years 7 months ago
Failure-aware checkpointing in fine-grained cycle sharing systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
Xiaojuan Ren, Rudolf Eigenmann, Saurabh Bagchi
107
Voted
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
15 years 5 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
14 years 7 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
81
Voted
JAR
2010
100views more  JAR 2010»
14 years 11 months ago
Geometry Constructions Language
We give a short survey of the main principles of our software for the visualisation and animation in mathematics and study the visibility and contour problems in the representation...
Predrag Janicic
IPPS
2009
IEEE
15 years 7 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