307 search results - page 20 / 62 » The communication complexity of distributed task allocation |
113
click to vote
ICPADS
1998
IEEE
15 years 4 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
IPPS
2003
IEEE
15 years 5 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...
103
click to vote
ISORC
2007
IEEE
15 years 6 months ago
2007
IEEE
Modern processors used in embedded systems are becoming increasingly powerful, having features like caches and pipelines to speedup execution. While execution speed of embedded so...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
117
click to vote
SAC
1995
ACM
15 years 3 months ago
1995
ACM
Experiments in High Energy Physics (HEP) generate tremendous amounts of data. For example, the accelerator at CERN is expected to generate petabytes per year. New HEP discoveries ...