Sciweavers

143 search results - page 20 / 29
» Cluster scheduling for explicitly-speculative tasks
Sort
View
FLAIRS
2010
13 years 9 months ago
Decision-Theoretic Simulated Annealing
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
Todd W. Neller, Christopher J. La Pilla
PROCEDIA
2010
148views more  PROCEDIA 2010»
13 years 5 months ago
SysCellC: a data-flow programming model on multi-GPU
High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specific...
Dominique Houzet, Sylvain Huet, Anis Rahman
IPPS
2005
IEEE
14 years 4 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
IPPS
2008
IEEE
14 years 5 months ago
Enabling personal clusters on demand for batch resources using commodity software
Providing QoS (Quality of Service) in batch resources against the uncertainty of resource availability due to the space-sharing nature of scheduling policies is a critical capabil...
Yang-Suk Kee, Carl Kesselman, Daniel Nurmi, Richar...
JSA
2000
115views more  JSA 2000»
13 years 10 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani