Paper Info
Title
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors
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.
Year
DOI
Venue
2010
10.1145/1835698.1835788
PODC
Keywords
Field
DocType
distributed shared memory,shared memory,time complexity,design process
Uniform memory access,Shared memory,Computer science,Parallel computing,Distributed memory,Cache-only memory architecture,Data diffusion machine,Memory management,Distributed shared memory,Distributed computing,Shared disk architecture
Conference
Citations 
PageRank 
References 
0
0.34
5
Authors
1
Name
Order
Citations
PageRank
Wojciech Golab121017.22