67 search results - page 2 / 14 » Contention-free Complexity of Shared Memory Algorithms |
DC
2010
13 years 4 days ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
JPDC
2006
2006
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
13 years 5 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 ...
SPAA
2003
ACM
13 years 10 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...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Parallel programming models should attempt to satisfy two conflicting goals. On one hand, they should hide architectural details so that algorithm designers can write simple, port...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...