674 search results - page 36 / 135 » The computational complexity of the parallel knock-out probl... |
EUROPAR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
117
click to vote
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
CCGRID
2003
IEEE
15 years 6 months ago
2003
IEEE
As computing systems grow in complexity, the cluster and grid communities require more sophisticated tools to diagnose, debug and analyze such systems. We have developed a toolkit...
EUROPAR
2003
Springer
15 years 6 months ago
2003
Springer
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
139
click to vote
PVG
2003
IEEE
15 years 6 months ago
2003
IEEE
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...