Sciweavers

25 search results - page 1 / 5
» Fast and Fair Mutual Exclusion for Shared Memory Systems
Sort
View
ICS
1999
Tsinghua U.
15 years 7 months ago
Application scaling under shared virtual memory on a cluster of SMPs
In this paper we examine how application performance scales on a state-of-the-art shared virtual memory (SVM) system on a cluster with 64 processors, comprising 4-way SMPs connect...
Dongming Jiang, Brian O'Kelley, Xiang Yu, Sanjeev ...
149
Voted
DC
2010
14 years 10 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
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...
Robert Danek, Wojciech M. Golab
110
Voted
ICPADS
1998
IEEE
15 years 7 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang
FMICS
2010
Springer
15 years 1 months ago
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurr...
Radu Mateescu, Wendelin Serwe