936 search results - page 16 / 188 » Task Graph Scheduling Using Timed Automata |
CLUSTER
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
ISSS
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper addresses the problem of mapping an application, which is highly dynamic in the future, onto a heterogeneous multiprocessor platform in an energy efficient way. A two-p...
RTSS
1992
IEEE
14 years 1 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
CCGRID
2008
IEEE
13 years 11 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
RTSS
2003
IEEE
14 years 3 months ago
2003
IEEE
We address the problem of providing compositional hard real-time guarantees in a hierarchy of schedulers. We first propose a resource model to characterize a periodic resource al...