On System with Distributed Shared Memory
Abstract
Distributed shared memory systems combine the scalability of loosely coupled multiple computer systems with the ease of usability of tightly coupled multiprocessors, providing with transparent replication and caching of data. This paper introduces distributed system for parallel computing – DSPC, that provides distributed shared memory on top of network of workstations. Programming model, memory organization, cache-coherence protocol and adaptive techniques are discussed in the paper. An evaluation with some well-known DSM benchmarks was done to present the overall performance of the DSPC system.
References
D. Bailey, L. Dagum, E. Barszcz and H. Simon. NAS parallel benchmark results. In Supercomputing, pages 386-393, 1992.
A. Ghazaryan. On system for distributed parallel computations - dspc. In Proc. Of the Int'l Conference on Computer Science and Information Technologies (CSIT 2001), August 2001.
L. Iftode, J. P. Singh, and K. Li. Scope consistency: A bridge between release consistency and entry consistency. In Proc. of the 8th ACM Annual Symp. on Parallel Algorithms and Architectures (SPAA'96), pages 277-287, June 1996.
H. Lu, S. Dwarkadas, A. Cox, and W. Zwaenepoel. Quantifying the performance differences between pvm and treadmarks. Journal of Parallel and Distributed Computing, 43, No. 2:65-78, June 1997.
H. Nalbandyan. On parallel processing with distributed shared memory. In Proc. of the Int'l Conference on Computer Science and Information Technologies (CSIT 2003), pages 317-320, September 2003.
S. Woo, M. Ohara, E. Torrie, J.P. Singh, and A. Gupta. The splash-2 programs: Charachterization and methodological considerations. In Proc. of the 22th Annual Int'l Sump. on Computer Architecture (ISCA'95), pages 24-36, June 1995.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
