Shared memory programs guarantee the correctness of concurrent accesses to shared data using interprocessor synchronization operations. The most common synchronization operators are locks, which are traditionally implemented via a mix of shared memory accesses and hardware synchronization primitives like test-and-set. In this paper, we argue that synchronization operations implemented using fas...

We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of a parallel program need to acquire exclusive access to a range of bytes. One application of this algorithm is for implementing MPI-IO’s atomic-access mode in the absence of atomicity guarantees from the underlying fil...

Programs running on NUMA machines are sensitive to memory access locality[3]. Acessing data on the local memory is significantly faster than remote memory. Thus, designing locks that can take advantage of this property would improve the performance. We review three papers related to this topic and study the behaviors of these NUMA aware locks. We implement these locks in C++, and evaluate them ...

Abstract Owing to the high capacity, low costs, and environment-friendly characteristics, shipping has an important role in sustainable development of economy, society, environment. However, with water transportation capacity many navigation locks, such as Three Gorges ship lock Beijing-Hangzhou Canal lock, been hard meet increasing demand for passing through locks. Thus, they have become “bott...