Sciweavers

936 search results - page 4 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
ACTAC
2007
69views more  ACTAC 2007»
13 years 7 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
CCGRID
2010
IEEE
13 years 8 months ago
A Bi-criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
Frédéric Desprez, Frédé...
FMSD
2008
94views more  FMSD 2008»
13 years 7 months ago
Optimal infinite scheduling for multi-priced timed automata
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larse...
PDP
2003
IEEE
14 years 21 days ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
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...
Olivier Beaumont, Arnaud Legrand, Yves Robert