Corpus ID: 1546

Scheduling Dags under Uncertainty

@article{Malewicz2007SchedulingDU,
  title={Scheduling Dags under Uncertainty},
  author={G. Malewicz},
  journal={ArXiv},
  year={2007},
  volume={abs/0705.1876}
}
  • G. Malewicz
  • Published 2007
  • Computer Science, Mathematics
  • ArXiv
This paper introduces a parallel scheduling problem where a directed acyclic graph modeling $t$ tasks and their dependencies needs to be executed on $n$ unreliable workers. Worker $i$ executes task $j$ correctly with probability $p_{i,j}$. The goal is to find a regimen $\Sigma$, that dictates how workers get assigned to tasks (possibly in parallel and redundantly) throughout execution, so as to minimize the expected completion time. This fundamental parallel scheduling problem arises in grid… Expand
1 Citations
Equilibrage de Charge pour les Grilles de Calcul: Classe des Tâches Dépendantes et Indépendantes
TLDR
La strategie proposee vise a reduire le temps de reponse and le cout de transfert des tâches soumises au systeme, a deux niveaux : Local, dans le but d'eviter le recours au reseau de communication a large echelle, and Global, pour une regulation de the charge de toute the grille. Expand

References

SHOWING 1-10 OF 43 REFERENCES
Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty
TLDR
Algorithm engineering approaches used to produce an efficient implementation of the polynomial time algorithm, and experiments demonstrating how the algorithm scales. Expand
A Tool for Prioritizing DAGMan Jobs and Its Evaluation
TLDR
This paper presents the design, implementation, and evaluation of a practical scheduling tool inspired by a recently developed scheduling theory, given a DAGMan input file with interdependent jobs, that significantly outperforms currently used schedules under a wide range of system parameters. Expand
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
TLDR
The problem of multiprocessor scheduling under uncertainty was introduced by Malewicz and was shown to be NP-hard even when all the jobs are independent, and polynomial-time approximation algorithms for the problem are presented. Expand
Batch-Scheduling Dags for Internet-Based Computing
TLDR
A new, batched, scheduling paradigm for Internet-based computing is developed, and a polynomial-time algorithm is developed for producing optimal batched schedules for a rich family of dags obtained by “composing” tree-structured building-block dags. Expand
Toward a theory for scheduling dags in Internet-based computing
TLDR
A suite of algorithms that decompose a given dag Gscr to expose its building blocks and an execution-priority relation xutri on building blocks are provided, which specify an optimal schedule for GscR. Expand
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality
TLDR
The IC-scheduling theory is extended in two ways: by expanding significantly the repertoire of DAGs that the theory can schedule optimally and by allowing one sometimes to shortcut the algorithmic process required to find optimal schedules. Expand
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
TLDR
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably in a distributed system composed of a reliable server and a massive number of unreliable workers and shows that this optimization problem is NP-hard. Expand
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
TLDR
This model considers parallel machine scheduling problems where the jobs are subject to precedence constraints, and the processing times of jobs are governed by independent probability distributions, and derives the first approximation algorithms for this model. Expand
A RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM WITH REATTEMPT AT FAILURE : A HEURISTIC APPROACH
TLDR
The objective of this paper is to propose a heuristic approach, including two dispatching rules which contain six policies, and find the best policy with which the quasi-minimum expected project duration of the problem can be obtained. Expand
A survey on the resource-constrained project scheduling problem
In this paper, research on the resource-constrained project scheduling problem is classified according to specified objectives and constraints. Each classified area is extensively surveyed, andExpand
...
1
2
3
4
5
...