Wojciech Golab
ABSTRACT
We consider asynchronous multiprocessors that support the distributed shared memory (DSM) model. Algorithms for such multiprocessors exploit the ability to co-locate shared objects with particular processes in order to reduce the cost of accessing shared memory. When a shared object fits inside a single memory word and operations on it are supported directly through machine instructions, it can be made local to any process simply by fixing its physical address. We show that even if the shared object is not supported in hardware directly, it can always be simulated using a software implementation that behaves as though it is local to some designated process. That is, operations applied by the designated process on the implemented object access only local base objects, which is non-trivial when processes synchronize by busy-waiting. We also discuss time complexity bounds for such locally-accessible implementations.
- J. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing, 16:75--110, 2003. Google Scholar
Digital Library
- W. Golab, V. Hadzilacos, D. Hendler, and P. Woelfel. Constant-RMR Implementations of CAS and Other Synchronization Primitives Using Read and Write Operations. In Proc. of 26th PODC, pages 3--12, 2007. Google ScholarDigital Library
- M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124--149, 1991. Google ScholarDigital Library
- M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463--492, 1990. Google ScholarDigital Library
Index Terms
- Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors
Recommendations
Brief announcement: NUMA-aware transactional memory
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingTransactional Memory (TM) research has focused on multi-core processors; limited research has been aimed at the clusters, leaving the area of NUMA (Non-Uniform Memory Access) system unexplored. The NUMA system's memory is physically distributed which ...
Brief announcement: a tight RMR lower bound for randomized mutual exclusion
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computingThe Cache Coherent (CC) and the Distributed Shared Memory (DSM) models are standard shared memory models, and the Remote Memory Reference (RMR) complexity is considered to accurately predict the actual performance of mutual exclusion algorithms in ...
Brief Announcement: Hardware Transactional Persistent Memory
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and ArchitecturesThis paper addresses the problem of creating durable transactions in byte-addressable Non-Volatile Memory or Persistent Memory (PM) when using Hardware Transactional Memory (HTM)-based concurrency control. It shows how HTM transactions can be ordered ...
Comments