534 search results - page 32 / 107 » On Scheduling Parallel Tasks at Twilight |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
80
Voted
SPAA
1995
ACM
15 years 1 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
IWOMP
2009
Springer
15 years 4 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
84
Voted
ICPP
2003
IEEE
15 years 3 months ago
2003
IEEE
e some simple working environment abstractions that hide the configuration heterogeneity of the machines that compose the grid from the user. Second, we introduce Work Queue with R...