6939 search results - page 458 / 1388 » Algorithm Engineering for Parallel Computation |
134
click to vote
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...
154
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...
135
click to vote
HIPC
2009
Springer
15 years 2 months ago
2009
Springer
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
130
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...
120
click to vote
ICPP
1993
IEEE
15 years 8 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...