Current computation technologies (from cluster computing to Grid computing ) are focused on collaboration, data sharing, and cycle stealing modes of interaction among dynamic and geographically distributed organizations. During the literature survey of doctoral research two computing paradigms: Grid computing and Distributed Shared Memory are explored. There has been extensive research in individual implementations of both but very few citations have proposed combined implementations. This paper is focused on implementing SMIG (Shared Memory Integrated with Grid), a model which integrates both paradigms. The paper discusses the design principles, architecture and execution in of various applications like Matrix multiplication, Merge sort and Bucket sort on SMIG volunteers. Based on the analysis of implementation results it was inferred that SMIG model is feasible, it can exploit resources in grid environment. In future it is proposed to execute the same applications on SMIG with dedicated machines and compare the results obtained on SMIG with volunteers.

1. Ann Chervenak, Ian Foster, Carl Kesselman, Charles Salisbury and Steven Tuecke; “The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets,” Journal of Network and Computer Applications, 23:187-200, 2001
2. B. Bershad, M. Zekauskas and W. Sawdon, “The Midway Distributed Shared Memory System”, in Proc.of the 38th IEEE Int’l CompCon Conf., pp. 528-537, Feb. 1993.
3. B. Cheung, C. Wang, and K. Hwang; “ A Migrating-Home Protocol for Implementing Scope Consistency Model on a Cluster of Workstations” in International Conference on Parallel and Distributed Processing Techniques and Applications, pages 821–827, 1999.
4. C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, andW. Zwaenepoel. “TreadMarks: Shared Memory Computing on Networks of Workstations”. IEEE Computer, 29(2):18–28, February 1996.
5. Deepti Vyas and Jaspal Subhlok; “Volunteer Computing on Clusters”.
6. Håkan Mattsson and Christoph Kessler; “Towards A Virtual Shared Memory Programming Environment for Grids”; Linköping University, Sweden.
7. I. Foster and C. Kesselman. “The Grid: Blueprint for a New Computing Infrastructure,” Morgan Kaufmann, 1999.
8. J. Carter, J. Bennet, and W. Zwaenepoel, “Implementation and Performance of Munin”, in Proc. of the 13th Sym. on Operating Systems Principles, pp. 152-164, Oct. 1991
9. J.B. Chang and C.K. Shieh, “Teamster: A Transparent Distributed Shared Memory for Cluster Symmetric Multiprocessors”, In proceedings of First IEEE/ACM symposium on Cluster computing and the Grid, 2001, pp 508-513.
10. J. Ryan and B. Coghlan, “SMG: Shared Memory for Grids”, Trinity College, Dublin.
11. K.Li, “IVY: A Shared Virtual Memory System for Parallel Computing”, in Proc. of the 1988 Int’l Conf. on Parallel Processing, Vol. 2, pp. 94-101, Aug. 1988.
12. Liang, C. Wu, J. Chang, and C. Sheih, “Teamster-G: A Grid Enabled Software DSM System”.
13. Sang-Min Park Jai-Hoon Kim; “Chameleon: A Resource Scheduler in a Data Grid Environment”.
14. Vipin Chaudhary, Hai Jiang; “Techniques for Migrating Computations on the Grid”.
15. W. Hu, W. Shi, and 2. Tang, “Reducing System Overhead in Home-Based Software DSMs”, in Proc. of the 13th Int’l Parallel Processing Symp., pp. 167-173, Apr. 1999.

Grid computing DSM SMIG