279 search results - page 16 / 56 » Low Overhead Parallel Schedules for Task Graphs |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...
ISSS
2002
IEEE
14 years 19 days 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...
CCGRID
2008
IEEE
13 years 9 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...
ICA3PP
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. Deploying lightweight tasks on grid resources would let the communication overhead dominate the overall application processing time. Our aim is to increase the resulting ...
ISCA
2007
IEEE
14 years 2 months ago
2007
IEEE
Chip multiprocessors (CMPs) are now commonplace, and the number of cores on a CMP is likely to grow steadily. However, in order to harness the additional compute resources of a CM...