6 search results - page 1 / 2 » A Comparison of robustness metrics for scheduling DAGs on he... |
CLUSTER
2007
IEEE
13 years 11 months ago
2007
IEEE
— A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led ...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
CLUSTER
2006
IEEE
13 years 10 months ago
2006
IEEE
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
HPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
Scheduling strategies for parallel and distributed computing have mostly been oriented toward performance, while striving to achieve some notion of fairness. With the increase in ...
JPDC
2008
13 years 4 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...