14 search results - page 2 / 3 » On Clustering Tasks in IC-Optimal Dags |
CCGRID
2005
IEEE
15 years 3 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
106
click to vote
CLUSTER
2007
IEEE
15 years 3 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
CLUSTER
2005
IEEE
15 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, ...
IPPS
2010
IEEE
14 years 6 months ago
2010
IEEE
In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite images. The workload involves large data sets, a...
106
click to vote
CCGRID
2008
IEEE
14 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...