Accelerated access to shared distributed arrays on distributed memory systems by access objects
In case of algorithms with non-local data access patterns virtual shared memory implementations commonly result in a huge lack of performance because of virtual shared memory latency. In order to avoid this problem, a system providing access to distributed data structures has been developed, implemented as a C++ object library. By means of this library the programmer may use special access objects as agents to access the distributed data structures. In case of accessing arrays these access objects may be buffers or queues. If the algorithms are suited for using these access objects, the communication bandwidth instead of the communication latency becomes the major performance factor.
Keywordsdistributed data structures virtual shared memory data prefetch latency hiding access objects
Unable to display preview. Download preview PDF.
- K. Li (1986) Shared Virtual Memory on Loosely Coupled Multiprocessors, Ph.D. Thesis, Yale UniversityGoogle Scholar
- H. Hellwagner, Virtually Shared Memory Architectures for Scaleable Universal Parallel Computers, Applied Computer Science and Software (Proc. Int'l Symp.), Springer-Verlag (1991)Google Scholar
- H. Hellwagner, A Survey of Virtually Shared Memory Schemes, SFB Report No. 342/ 33/90A, Techn. Univ. Munich (1990)Google Scholar
- B. Nitzberg, V. Lo, Distributed Shared Memory: A Survey of Issues and Algorithms, COMPUTER 24, 8(1991)Google Scholar