674 search results - page 31 / 135 » The computational complexity of the parallel knock-out probl... |
129
click to vote
ICPADS
1998
IEEE
15 years 5 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...
143
click to vote
DCOSS
2011
Springer
14 years 1 months ago
2011
Springer
—To overcome the limitations of specific positioning techniques for mobile wireless nodes and achieve a high accuracy, the fusion of heterogeneous sensor information is an appea...
128
click to vote
SOFSEM
2000
Springer
15 years 4 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
112
click to vote
CLUSTER
2005
IEEE
15 years 7 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, ...
146
click to vote
ICPADS
1994
IEEE
15 years 5 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...