822 search results - page 39 / 165 » Contention in shared memory algorithms |
129
Voted
CAIP
1995
Springer
15 years 6 months ago
1995
Springer
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
122
Voted
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
15 years 2 months ago
In distributed shared memory multiprocessors, remote memory references generate processor-to-memory traffic, which may result in a bottleneck. It is therefore important to design ...
107
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
124
click to vote
CAV
2008
Springer
15 years 4 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
125
click to vote
ASIAN
2004
Springer
15 years 7 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...