簡易檢索 / 詳目顯示

研究生: 林長毅
Chang-Yi Lin
論文名稱: 軟體分散式共享記憶體系統中適應的遷移家協定
An Adaptive Migratory Home Protocol for Software DSM Systems
指導教授: 鍾葉青
Yeh-Ching Chung
口試委員:
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Computer Science
論文出版年: 2004
畢業學年度: 92
語文別: 英文
論文頁數: 24
中文關鍵詞: 分散式共享記憶體系統基於家協定家遷移
相關次數: 點閱:2下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 在軟體分散式共享記憶體系統中,基於家(home-based)的協定是很好的設計,因為它的實作容易、很少的記憶體額外開銷以及很好的效能。基於家的協定可以分為兩類,固定的家協定以及遷移的家協定。固定的家協定產生的頁錯誤比遷移的家協定來的少,它適合有高程度頁分享性的應用程式。遷移的家協定可以節省頁差的製造和頁差的傳遞,它適合有低程度頁分享性和的應用程式和有大量頁差的應用程式。對於一個應用程式來說,在某一段時間之內,它適合固定的家協定,而在別段時間之內,它適合遷移的家協定。對於應用程式的效能而言,一個可以適應於固定家協定和遷移家協定的協定是很重要的。在這篇論文裡面,我們提出一個結合固定的家協定和遷移的家協定優點的適應的遷移家協定。在適應的遷移家協定中,頁的家結點可以根據應用程式的行為改變頁的狀態,再某個時段之內,頁的狀態可能是在固定的家協定之中,而在別的時段頁的狀態是在遷移的家協定之中。所以適應的遷移家協定可以適應固定的家協定和遷移的家協定。為了評估適應的遷移家協定,我們針對這三種協定測試了八個應用程式,實驗結果顯示固定的家協定對於有分享性的存取模式的應用程式表現很好,遷移的家協定則對有遷移性的存取模式的應用程式擁有很好的效能,而適應的遷移家協定介於這兩個協定之間,對於大部分的應用程式都表現都很好。


    In software distributed shared memory systems, home-based protocols are very good designs because of easy implementation, little memory overheads and good performance. The home-based protocols can be divided into two categories, the fix home protocol and the migratory home protocol. The fix home protocol produces less number of page faults than the migratory home protocol. It is suitable for applications with high degree of page sharing. The migratory home protocols can save the number of diff creating and diff propagation. It is suitable for applications with low degree of page sharing and large number of diffs. For an application program, its execution behavior is suitable for the fixed home protocol in some time periods and is suitable for the migratory home protocol in some other time periods. A protocol that can be adapted between the fixed home protocol and the migratory home protocol is important for the performance of an application program. In this thesis, we proposed an adaptive migratory home protocol which combines the advantages of the fixed home and the migratory home protocols. In the adaptive migratory home protocol, the home node of a page can change the state of the page according the application behavior. The state of a page may be in the fixed home protocol in some time periods and in the migratory home protocol in other time periods. Therefore, the adaptive migratory home protocol can adapt between the fixed home protocol and the migratory home protocol. To evaluate the adaptive migratory home protocol, we have implemented the proposed protocol along with the home-based protocol and the migratory home protocol. We tested eight application programs for the three protocols on the same platform. The experimental result shows that the home-based protocol works well for applications with sharing access pattern. The migratory home protocol has good performance for migratory access pattern. The performance of the adaptive migratory home protocol is in between these two protocols and performs well for most of the applications.

    Chapter 1 Introduction…………………………………………………………...1 Chapter 2 Preliminaries………………………………………………………….4 Chapter 3 An Adaptive Migratory Home Protocol..........…………………….9 3.1 INIT □ FIX and INIT □ MIG………………………………………….....11 3.2 FIX □ MIG………………………………………………………………...13 3.3 MIG □ FIX………………………………………………………………...14 Chapter 4 Performance Evaluation……………………………………………...17 Chapter 5 Conclusions…..………………………………………………………..22 References......................................................................................................23

    [1] C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel, “TreadMarks: Shared Memory Computing on Networks of Workstations,” IEEE Computer, Volume 29, No. 2, pages 18-28, February 1996.
    [2] John B. Carter, John Bennett, Willy Zwaenepoel, “Implementation and Performance of Munin,” Proceedings of the 13th ACM Symposium on Operating Systems Principles (SOSP-13), pages 152-164, October 1991.
    [3] Benny Wang-Leung Cheung, Cho-Li Wang and Kai Hwang, “A Migrating-Home Protocol for Implementing Scope Consistency Model on a Cluster of Workstations,” Journal of Information Science and Engineering, 1999.
    [4] A. L. Cox, E. de Lara, Y. C. Hu, and W. Zwaenepoel, “A Performance Comparison of Homeless and Home-Based Lazy Release Consistency Protocols in Software Shared Memory,” Proceedings of the 5th IEEE Symposium on High-Performance Computer Architecture (HPCA-5), pages 279-283, January 1999.
    [5] K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy, “Memory consistency and event ordering in scalable shared memory multiprocessors,” Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26, May 1990.
    [6] Weiwu Hu, Weisong Shi, Zhimin Tang, Zhiyu Zhou, “JIAJIA: An SVM System Based on a New Cache Coherence Protocol,” Proceedings of the High-Performance Computing and Networking Europe 1999 (HPCN'99), pages 463-472, April 1999.
    [7] Weiwu Hu, Weisong Shi and Zhimin Tang, “Home Migration in Home Based Software DSMs,” Proceedings of ACM 1st Workshop on Software DSM System, (in Conjunction with ICS'99), Greece, June, 1999.
    [8] Liviu Iftode, “Scope Consistency: A Bridge between Release Consistency and Entry Consistency,” Proceedings of the 8th ACM Annual Symposium on Parallel Algorithms and Architectures (SPAA'96), pages 277-287, June 1996.
    [9] Liviu Iftode, “Home-based Shared Virtual Memory,” Ph.D. Thesis, Princeton University, June 1998.
    [10] Pete Keleher, “The Relative Importance of Concurrent Writers and Weak Consistency Models,” Proceedings of the 16th Int'l Conference on Distributed Computing Systems (ICDCS-16), pages 91-98, May 1996.
    [11] Pete Keleher, Alan L. Cox, Willy Zwaenepoel, “Lazy Release Consistency for Software Distributed Shared Memory,” Proceedings of the 19th Annual Int'l Symposium on Computer Architecture (ISCA'92), pages 13-21, May 1992.
    [12] Peter J. Keleher, “Symmetry and Performance in Consistency Protocols,” International Conference on Supercomputing (ICS’99), June 1999.
    [13] Peter J. Keleher, “The Impact of Symmetry on Software Distributed Shared Memory,” Journal of Parallel and Distributed Computing (JPDC), 60(11): 1388-1419, 2000.
    [14] Leslie Lamport, “How to make a multiprocessor computer that correctly executes multiprocess programs,” IEEE Transactions on Computers, C-28(9):690-691, September1979.
    [15] Kai Li, “IVY: a shared virtual memory system for parallel computing,” Proceedings 1988 International Conference on Parallel Processing, volume 2, pages 94-101, August 1988.
    [16] Kai Li and Paul Hudak, “Memory Coherence in Shared Virtual Memory Systems,” ACM Transactions on Computer Systems, 7(4):321-359, November 1989.
    [17] L. R. Monnerat and R. Bianchini, “Efficiently Adapting to Sharing Patterns in Software DSMs,” Proceedings of the 4th IEEE International Symposium on High-Performance Computer Architecture (HPCA98), Feb 1998.
    [18] M.C. Ng and W.F. Wong, “Adaptive Schemes for Home-based DSM Systems,” Proceedings of the 1999 Workshop on Software Distributed Shared Memory, pages 13-20, June 1999.
    [19] Per Stenstrom, “A Survey of Cache Coherence Schemes for Multiprocessors,” IEEE Computer, 23(6):12--24, June 1990.
    [20] Yuanyuan Zhou, Liviu Iftode and Kai Li, “Performance Evaluation of Two Home-Based Lazy Release Consistency Protocols for Shared Virtual Memory Systems,” Proceedings of the 2nd Symposium on Operating Systems Design and Implementation, October 1996.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)

    QR CODE