204 search results - page 11 / 41 » Provable algorithms for parallel generalized sweep schedulin... |
127
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
144
Voted
PDP
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
146
Voted
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper proposes a comprehensive modeling architecture for workloads on parallel computers using Markov chains in combination with state dependent empirical distribution functi...
144
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
129
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...