Sciweavers

169 search results - page 5 / 34
» New Challenges of Parallel Job Scheduling
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 11 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
FUZZIEEE
2007
IEEE
14 years 2 months ago
Genetic Fuzzy Systems applied to Online Job Scheduling
Abstract-- This paper presents a comparison of three different design concepts for Genetic Fuzzy systems. We apply a Symbiotic Evolution that uses the Michigan approach and two app...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
IWCC
1999
IEEE
14 years 2 months ago
Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster
This paper will discuss high performance clustering from a series of critical topics: architectural design, system software infrastructure, and programming environment. This will ...
David A. Bader, Arthur B. Maccabe, Jason R. Mastal...
EUROPAR
2010
Springer
13 years 10 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
PPOPP
2006
ACM
14 years 4 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski