Sciweavers

34 search results - page 3 / 7
» Predicting job start times on clusters
Sort
View
CCGRID
2010
IEEE
13 years 6 months ago
Decentralized Resource Availability Prediction for a Desktop Grid
In a desktop grid model, the job (computational task) is submitted for execution in the resource only when the resource is idle. There is no guarantee that the job which has starte...
Karthick Ramachandran, Hanan Lutfiyya, Mark Perry
JSAT
2010
108views more  JSAT 2010»
13 years 1 days ago
Experiment design and administration for computer clusters for SAT-solvers (EDACC)
The design of a SAT-solver or the modification of an existing one is always followed by a phase of intensive testing of the solver on a benchmark of instances. This task can be ve...
Adrian Balint, Daniel Gall, Gregor Kapler, Robert ...
EUROSYS
2011
ACM
12 years 8 months ago
Scarlett: coping with skewed content popularity in mapreduce clusters
To improve data availability and resilience MapReduce frameworks use file systems that replicate data uniformly. However, analysis of job logs from a large production cluster show...
Ganesh Ananthanarayanan, Sameer Agarwal, Srikanth ...
JSSPP
2007
Springer
13 years 11 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski
GRID
2008
Springer
13 years 6 months ago
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...
Marco Aurélio Stelmar Netto, Rajkumar Buyya