Sciweavers

17 search results - page 1 / 4
» Scheduling Restartable Jobs with Short Test Runs
Sort
View
JSSPP
2009
Springer
13 years 11 months ago
Scheduling Restartable Jobs with Short Test Runs
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
Ojaswirajanya Thebe, David P. Bunde, Vitus J. Leun...
JAIR
2007
106views more  JAIR 2007»
13 years 4 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
SC
2000
ACM
13 years 9 months ago
An Object-Oriented Job Execution Environment
This is a project for developing a distributed job execution environment for highly iterative jobs. An iterative job is one where the same binary code is run hundreds of times wit...
Lance Smith, Rod Fatoohi
CLUSTER
2006
IEEE
13 years 10 months ago
JOSHUA: Symmetric Active/Active Replication for Highly Available HPC Job and Resource Management
Most of today‘s HPC systems employ a single head node for control, which represents a single point of failure as it interrupts an entire HPC system upon failure. Furthermore, it...
Kai Uhlemann, Christian Engelmann, Stephen L. Scot...
JAR
2000
129views more  JAR 2000»
13 years 4 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...