Bounds on Shared Memory for Mutual Exclusion

Bounds on Shared Memory for Mutual Exclusion

Time Complexity Bounds for Shared-memory Mutual Exclusion

YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...

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 concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist in the shared-memory setting, such as Peterson’s or Dekker’s well-known protocols. Although the functional correctness of these protoco...

Tight RMR Lower Bounds for Mutual Exclusion

We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, h...

Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols

Mutual exclusion protocols are an essential building block of concurrent shared-memory systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist, such as Peterson’s or Dekker’s well-known protocols. Although the functional correctness of these protocols has been stu...