6897 search results - page 527 / 1380 » Parallelization of Modular Algorithms |
118
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper explores the correlation of instruction counts and cache misses to runtime performance for a large family of divide and conquer algorithms to compute the Walsh–Hadama...
134
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
139
Voted
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
161
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...
139
click to vote
EUROPAR
1999
Springer
15 years 9 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...