1855 search results - page 221 / 371 » A coding theorem for distributed computation |
149
click to vote
PPOPP
1999
ACM
15 years 8 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
128
click to vote
ICS
1999
Tsinghua U.
15 years 8 months ago
1999
Tsinghua U.
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
148
Voted
PPSN
1998
Springer
15 years 8 months ago
1998
Springer
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
100
click to vote
IPPS
1993
IEEE
15 years 8 months ago
1993
IEEE
Abstract - Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies ar...
135
click to vote
ISHPC
2000
Springer
15 years 7 months ago
2000
Springer
Traditional parallel compilers do not effectively parallelize irregular applications because they contain little looplevel parallelism due to ambiguous memory references. We explo...