534 search results - page 20 / 107 » On Scheduling Parallel Tasks at Twilight |
101
Voted
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
175
click to vote
PC
2011
14 years 4 months ago
2011
We investigate the efficient iterative solution of large-scale sparse linear systems on shared-memory multiprocessors. Our parallel approach is based on a multilevel ILU precondit...
ISCA
2007
IEEE
15 years 4 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...
ISCC
2002
IEEE
15 years 2 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
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...