Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Implementation and performance of Munin
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Global optimizations for parallelism and locality on scalable parallel machines
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Scope consistency: a bridge between release consistency and entry consistency
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Using fine-grain threads and run-time decision making in parallel computing
Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
Optimizing communication in HPF programs on fine-grain distributed shared memory
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
MultiView and Millipage — fine-grain sharing in page-based DSMs
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
IEEE Transactions on Parallel and Distributed Systems
Compilation and Runtime-Optimizations for Software Distributed Shared Memory
LCR '00 Selected Papers from the 5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Run-Time Support for Distributed Sharing in Typed Languages
LCR '00 Selected Papers from the 5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Home-based shared virtual memory
Home-based shared virtual memory
TreadMarks: distributed shared memory on standard workstations and operating systems
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
| Hi-index | 0.00 |
Despite their clear advantage in scalability, twodimensional data distributions are not efficiently supported by current software distributed shared memory (SDSM) systems. This is because sharing between nodes occurs on both columns and rows. Sharing in two dimensions is not a good match for SDSM systems, because either a row- or columnmajor data layout of pages leads to (1) severe thrashing, if a strong memory consistency is used, or (2) exchange of unnecessary data between nodes, if a relaxed memory consistency is used.This paper examines two alternatives for efficiently supporting two-dimensional data distributions in SDSM systems. We develop two new page consistency protocols for this purpose. One protocol, called Explicit-2D, requires that the user or compiler explicitly identify truly shared elements within a page; the other, called Implicit-2D, infers such elements implicitly. Knowledge of truly shared elements allows the SDSM, at synchronization points, to send only truly shared data, which reduces diff sizes. As the problem size or the number of nodes grows, programs written using a two-dimensional distributions with our new protocols are superior to those using a one-dimensional one. The difference in our tests is as much as 12% for Red-Black SOR, and increases with the problem size and number of nodes.