跳到主要內容

臺灣博碩士論文加值系統

(44.201.97.0) 您好!臺灣時間:2024/04/19 13:43
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:吳俊毅
研究生(外文):Chun-Yi Wu
論文名稱:設計與實現一個可於網格上執行的軟體分散式共享記憶體系統
論文名稱(外文):Design and Implementation of a Software DSM System on Grid Environments
指導教授:梁廷宇謝錫堃謝錫堃引用關係
指導教授(外文):Tyng-Yeu LiangCe-Kuen Shieh
學位類別:碩士
校院名稱:國立成功大學
系所名稱:電腦與通信工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2005
畢業學年度:93
語文別:英文
論文頁數:48
外文關鍵詞:grid computingDSM
相關次數:
  • 被引用被引用:2
  • 點閱點閱:116
  • 評分評分:
  • 下載下載:9
  • 收藏至我的研究室書目清單書目收藏:0
  In this paper, we have developed a transparent execution environment for grid-enabled software DSM system, called Teamster-G. This system allows users to allocate the resources on grids and run their DSM programs on a virtual cluster which consists of computers that distribute at the same or different sites transparently. Moreover, in order to improve the performance of DSM applications on grids, we also propose to reorganize traditional DSM systems to a two-level structure. In the past, most traditional DSM systems are developed in LANs and organize participating nodes in a flat and full-connected topology. Since the resources on grids may distribute geographically, the cost of maintaining data consistency becomes more expensive because the distance between participating nodes becomes longer and the network environment on grids is more unstable and unpredictable than LANs. By organizing software DSM systems to the proposed structure, we can not only use more resources that can not be used for executing DSM applications before, but also reduce the communication cost by caching some sharing data on specified nodes to avoid inter-cluster communications. Our experiments show that Teamster-G succeeds in reducing inter-cluster communications, and improving the execution time of DSM applications executed on WANs about 15% than traditional organizations.
CHAPTER 1 INTRODUCTION..................................................1
CHAPTER 2 BACKGROUND....................................................5
 2.1 SOFTWARE DSM SYSTEM..............................................5
 2.2 TEAMSTER DSM SYSTEM..............................................6
 2.3 GLOBUS TOOLKITS...................................................7
CHAPTER 3 TEAMSTER-G....................................................9
 3.1 TEAMSTER-G ARCHITECTURE...........................................9
 3.2 THE TWO-LEVEL DSM SYSTEM STRUCTURE............................13
 3.3 DATA CONSISTENCY.................................................16
CHAPTER 4 IMPLEMENTATION...............................................21
 4.1 CACHE MECHANISM..................................................21
 4.2 TWO-LEVEL DIFF PROPAGATION......................................26
 4.3 TRANSMISSION PROTOCOLS...........................................30
 4.4 OTHER MODULES....................................................31
CHAPTER 5 PERFORMANCE..................................................34
 5.1 OVERHEAD OF RESOURCE DISCOVERY, SELECTION AND ALLOCATION....34
 5.2 REAL APPLICATIONS................................................35
CHAPTER 6 RELATED WORKS...............................................41
CHAPTER 7 CONCLUSION AND FUTURE WORK................................44
REFERENCES...............................................................46
[1] Foster I, Kesselman C (eds.). “The Grid: Blueprint for a Future Computing Infrastructure”. Morgan Kaufmann: San Francisco, CA, 1999.
[2] Mark Baker, Rajkumar Buyya, and Domenico Laforenza, “Grids and Grid Technologies for Wide-Area Distributed Computing”, International Journal of Software: Practice and Experience (SPE), Volume 32, Issue 15, pp.1437-1466, 2002.
[3] Foster I, Kesselman C. “Globus: A Metacomputing infrastructure toolkit”, International Journal of Supercomputer Applications 11(2): pp.115–128, 1997.
[4] Grimshaw A, Wulf W., “The Legion vision of a worldwide virtual computer”, Communications of the ACM 1997; 40(1). 25. Avaki Corporation. http://www.avaki.com/.
[5] Rajkumar Buyya and Srikumar Venugopal, “The Gridbus Toolkit for Service Oriented Grid and Utility Computing: An Overview and Status Report��, Proceedings of the First IEEE International Workshop on Grid Economics and Business Models, pp.19-36, 2004.
[6] Gong L. Project JXTA: A technology overview. Sun Whitepaper, August 2001. http://www.jxta.org/.
[7] Frey J., Tannenbaum T., Livny M., Foster I., Tuecke S., “Condor-G: A Computation Management Agent for Multi-Institutional Grids”, The Proceedings of 10th IEEE International Symposium on High Performance Distributed Computing, pp.55-63, 2001.
[8] David Abramson, Rajkumar Buyya, and Jonathan Giddy, “A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Broker��, Future Generation Computer Systems (FGCS) Journal, Volume 18, Issue 8, pp.1061-1074, 2002.
[9] H. Casanova, G. Obertelli, F. Berman, R. Wolski, “The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid”, Proceedings of Super Computing 00, 2000. http://grail.sdsc.edu/projects/apst/publications.html
[10] Nicholas T. Karonis, Brian R. Toonen, Ian T. Foster, “MPICH-G2: A Grid-enabled implementation of the Message Passing Interface”. Journal of. Parallel Distributed. Computing, 63(5): p.551-563, 2003.
[11] K. Seymour, H. Nakada, S. Matsuoka, D. Dongarra, C. Lee, and H. Casanova, “Gridrpc: A remote procedure call api for grid computing”. ICL Technical Report ICL-UT-02-06, Innovative Computing Laboratory, Department of Computer Science, University of Tennessee, June 2002.
[12] Von Laszewski, G., Foster, I., Gawor, J., Smith, W., and Tuecke, S., “CoG Kits: A Bridge between high Performance Grids Computing and High Performance Grids”, ACM 2000 Grade Conference, 2000. http://www.globus.org
[13] K. Li. “IVY: A shared virtual memory system for parallel computing”. In Proceedings of the 1988 International Conference on Parallel Processing (ICPP'88), pp. 94-101, 1988.
[14] J.B. Carter, J.K. Bennett and W. Zwaenepoel. “Implementation and Performance of Munin”. In Proceedings of 13th ACM Symposium on Operating System Principles, p. 152-164, 1991.
[15] C. Amza, A.L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, W. Zwaenepoel, “TreadMarks: Shared Memory Computing on Networks of Workstations”. IEEE Computer, 29 (2), pp. 18-28, 1996.
[16] E. Speight and J.K. Bennett. “Brazos: A third generation DSM system”. Proceedings of the 1997 USENIX Windows/NT Workshop, pp. 95-106, 1997.
[17] P. W. Hutto and M. Ahamad. “Slow Memory: Weakening Consistency to Enhance Concurrency in Distributed Shared Memories”, Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS-10), pp. 302-311, 1990.
[18] Tyng-Yeu Liang, Jyh-Chang Ueng, Ce-Kuen Shieh, Deh-Yuan Zhuang, JUN-QI Lee. “Distinguishing Sharing Types to Minimize Communication in Software Distributed Shared Memory Systems”, Journal of Systems and Software, vol.55, pp.73-85, 2000.
[19] K. Thitikamol and P. Keleher. “Thread migration and load balancing in non-dedicated environments”. In The Proceeding of the 14th International Parallel and Distributed Processing Symposium, pp. 583-588, 2000.
[20] J. B. Chang, Tyng-Yeu Liang, Ce-Kuen Shieh, “Teamster: A Transparent Distributed Shared memory for Clustered Symmetric Multiprocessors”, accepted for publication in the special issue of The Journal of Supercomputing, September 6, 2003.
[21] Michael Litzkow, Miron Livny, and Matt Mutka, "Condor - A Hunter of Idle Workstations", Proceedings of the 8th International Conference of Distributed Computing Systems, pp. 104-111, 1988.
[22] Abramson D., Sosic R., Giddy J. and Hall B., “Nimrod: A Tool for Performing Parametised Simulations using Distributed Workstations”, The 4th IEEE Symposium on High Performance Distributed Computing, pp.112-121, 1995. http://www.csse.monash.edu.au/~davida/papers/nimrod.pdf
[23] K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman. “Grid Information Services for Distributed Resource Sharing,” Proceedings of the Tenth IEEE International Symposium on High-Performance Distributed Computing (HPDC-10), IEEE Press, August 2001.
[24] K. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S Martin, W. Smith, and S. Tuecke. “A resource management architecture for metacomputing systems,” In the 4th Workshop on Job Scheduling Strategies for Parallel Processing, 1998.
[25] DeQing Chen, Chunqiang Tang, Xiangchuan Chen, Sandhya Dwarkadas, Michael L. Scott, “Multi-level Shared State for Distributed Systems”, The Proceedings of ICPP2002, Vancouver, pp.131-140, BC, August 2002.
[26] Dandamudi, S.P.; Ayachi S., “Performance of hierarchical processor scheduling in shared-memory multiprocessor systems,” Computers, IEEE Transactions on , Volume: 48 , Issue: 11, pp.1202 – 1213, Nov. 1999.
[27] R. Stets, S. Dwarkadas, N. Hardavellas, G. Hunt, L. Kontothanassis, S. Parthasarathy, and M. Scott. “Cashmere-2L: Software Coherent Shared Memory on a Clustered Remote-Write Network”, In Proc. of the 16th ACM Symp. on Operating Systems Principles, St. Malo, France, Oct. 1997.
[28] S. Parthasarathy and S. Dwarkadas. “InterAct: Virtual Sharing for Interactive Client-Server Applications,” In 4th Workshopon Languages, Compilers, and Run-time Systems forScalable Computers, May 1998.
[29] D. Chen, S. Dwarkadas, S. Parthasarathy, E. Pinheiro, and M. L. Scott. “InterWeave: A Middleware System for Distributed Shared State,” Proceedings, LCR 2000, Rochester, NY, May 2000
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top