跳到主要內容

臺灣博碩士論文加值系統

(18.205.192.201) 您好!臺灣時間:2021/08/05 10:07
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:傅俊賓
研究生(外文):Chun-Pin Fu
論文名稱:一個在資料網格檔案副本動態管理服務
論文名稱(外文):A Dynamical Maintenance Service for File Replication in Data Grids
指導教授:楊朝棟楊朝棟引用關係
指導教授(外文):Chao-Tung Yang
學位類別:碩士
校院名稱:東海大學
系所名稱:資訊工程與科學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2007
畢業學年度:95
語文別:英文
論文頁數:47
中文關鍵詞:網格計算資料網格副本管理動態管理服務
外文關鍵詞:Grid ComputingData GridReplica ManagementDynamic Maintenance Service
相關次數:
  • 被引用被引用:0
  • 點閱點閱:224
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
資料網格(Data Grid)使得分散在不同區域上的計算及儲存資源(同質或異質),可以達到分享、選擇、以及相互的溝通的應用。尤其是需要分析大量且密集資料的科學實驗,諸如高能物理、生物資訊的運用、以及氣象的模擬等,透過應用資料網格的都獲得良好的問題解決方式。
近幾年來,許多研究學者持續地研究資料網格中副本機制的應用。副本機制可以讓一份資料產生多份的副本並且分散儲存於不同的地方,使得世界各地的研究學者可以容易取得所需的資料,縮短資料取得時間,提高資料分析的效率。
由於網路的頻寬狀態屬於變動,使用者所需的資料會隨著時間變動,資料存取點亦需隨之變更。在本論文中,提出了一個動態管理服務 Dynamic Maintenance Service (DMS)動態管理資料網格中的資料。資料副本會動態的調整至適當的位置以供使用者使用,並且將存取需求次數不多的副本刪除,以節省硬碟空間,有效地應用於儲存工作執行時所產生的暫存檔或結果檔。
先前學者提出的一個動態管理副本的演算法稱之 Bandwidth Hierarchy based Replication (BHR)。BHR演算法執行時會發生副本數目受到限制,進而影響整體工作執行的時間。我們的方法(DMS)有效地產生目前網格環境所需的副本數量,並且有效的利用磁碟空間,也減少了整體工作完成所需時間,且避免發生工作執行時儲存空間不足的情況,並且配合實驗佐證。
As large amount of data that is produced by scientific experiments and simulations, data grid is a very important and useful technique to solve these kinds of problems. Data replication is a technique that many researchers discuss in past years in data grid. It can create many copies of file and stored in the appropriate location to shorten the time of getting the file. In this thesis, we propose a dynamical maintenance service of replication to maintain the data in grid environment. Replicas will be adjusted to the appropriate locations for using. Bandwidth Hierarchy based Replication (BHR) algorithm is a strategy to maintain replica dynamically. We point out a scenario that BHR algorithm will cause a mistake when it operates. That mistake will cause the performance of grid environment become worse. We propose the maintenance strategy called Dynamic Maintenance Service (DMS) which is aimed at overcoming the mistake proposed. The contributions of this thesis are that the data grid environment will be more efficiency by using DMS algorithm. And the experimental results show that the DMS algorithm is more useful and efficient than other replication strategies.
摘要…………………………………………………………………………….i
Abstract ii
Acknowledgements……………………………………………...…………..iii
Table of Contents iv
List of Tables vi
List of Figures viiii
Chapter 1 Introduction 1
1.1 Motivations 1
1.2 The Goal and Contributions 2
1.3 Thesis Organization 3
Chapter 2 Background 4
2.1 Grid Computing 4
2.1.1 Data Grid 4
2.1.2 Replica Management 9
2.1.3 Replica Catalog 9
2.2 Globus Toolkit and GridFTP 11
2.3 Network Weather Service (NWS) 12
2.4 Related Works 12
Chapter 3 System Design and Implementation 15
3.1 Software Stack Diagram 15
3.2 The Operation of DMS 19
3.3 Parameters and Evaluation Model 21
3.3.1 Affect Parameters 21
3.3.2 Cost Model 22
3.4 The Algorithm 24
Chapter 4 Experimental Results 31
4.1 Experimental Environment 31
4.2 Parameters Setting 32
4.3 Results 35
Chapter 5 Conclusion and Future Work 42
Reference 44
[1]B. Allcock, J. Bester, J. Bresnahan, A. Chervenak, I. Foster, C. Kesselman, S. Meder, V. Nefedova, D. Quesnel, and S. Tuecke, “Data Management and Transfer in High-Performance Computational Grid Environments,” Parallel Computing, 28(5):749-771, May 2002.
[2]B. Allcock, J. Bester, J. Bresnahan, A. Chervenak, I. Foster, C. Kesselman, S. Meder, V. Nefedova, D. Quesnel, and S. Tuecke, “Secure, efficient Data Transport and Replica Management for High-Performance Data-Intensive Computing,” Proceedings of the Eighteenth IEEE Symposium on Mass Storage Systems and Technologies, pp. 13-28, 2001.
[3]CERN - http://public.web.cern.ch/Public/Welcome.html
[4]R. S. Chang and J. S. Chang, “Adaptable Replica Consistency Service for Data Grids”, Proceeding of The third International conference of Information Technology (ITNG’06), page 646-651, 2006.
[5]A. Chervenak, I. Foster, C. Kesselman, C. Salisbury, and S. 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.
[6]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’01), 181-194, August 2001.
[7]J. Fathali, “A genetic Algorithm for the p-median problem with pos/neg weights”, Applied Mathematics and Computation, 8 August 2006 (to appear)
[8]M.L. Fisher, “The Lagrangian relaxation method for solving integer programming problems”, Management Science, 27, pp. 1-18.
[9]I. Foster, “The Grid: A New Infrastructure for 21st Century Science”, Physics Today, 55(2):42-47, 2002.
[10]I. Foster and C. Kesselman, “The Grid 2: Blueprint for a New Computing Infrastructure (Elsevier Series in Grid Computing), Morgan Kaufmann, 2nd edition,” 1999.
[11]I. Foster and C. Kesselman, “Globus: A Metacomputing Infrastructure Toolkit,” International Journal of Supercomputer Applications and High Performance Computing, 11(2), pp. 115-128, 1997.
[12]L. E. Jackson , G. N. Rouskas, Matthias F.M. Stallmann, “The directional p-median problem: Definition, complexity, and algorithms”, European Journal of Operational Research, 2006 (to appear)
[13]Java CoG - http://www-unix.globus.org/cog/
[14]NWS - http://nws.cs.ucsb.edu/
[15]OptorSim – A Replica Optimizer Simulation: http://edg-wp2.web.cern.ch/edg-wp2/optimization/optorsim.html
[16]S. M. Park, J. H. Kim and Y. B. Ko,” Dynamic Grid Replication Strategy based on Internet Hierarchy”, , The second International Workshop on Grid and cooperative Computing (GCC2003), page 838-846, 2003.
[17]S. M. Park and J. H. Kim, “Chameleon: A Resource Scheduler in A Data Grid Environment,” Proceedings of Third Internatinal Symposium on Cluster Computing and the Grid, 2003.
[18]R. M. Rahman, K. Barker, and R. Alhajj, “Replica Placement Design with Static Optimality and Dynamic Maintainability”, Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), pp. 434-437, 2006.
[19]R. M. Rahman, K. Barker, and R. Alhajj, “Effective Dynamic Replica Maintenance Algorithm for the Grid Environment”, Proceeding of Advances in Grid and Pervasive Computing Vol. 3947, on Grid and Pervasive Computing 2006 (GPC2006), pp. 336-345, 2006.
[20]K. Ranganathan and I. Foster, "Design and evaluation of dynamic replication strategies for a high performance data Grid," Proceeding of International Conference on Computing in High Energy and Nuclear Physics
[21]X. H. Shi, H. Jin, W. Z. Qiang, and D. Q. Zou, “An Adaptive Meta-scheduler for Data-Intensive Applications”, Proceeding of Grid and Cooperative Computing (GCC’03), page 830-837, 2003.
[22]H. Stockinger, A. Samar, B. Allcock, I. Foster, K. Holtman, and B. Tierney, “File and Object Replication in Data Grids,” Journal of Cluster Computing, 5(3):305-314, 2002.
[23]The Grid Project – http://www.globus.org/
[24]S. Vazhkudai, S. Tuecke, I. Foster, “Replica Selection in the Globus Data Grid,” Proceedings of the 1st International Symposium on Cluster Computing and the Grid (CCGRID 2001), pp. 106-113, May 2001.
[25]S. Venugopal, R. Buyya, and K. Ramamohanarao, “A Taxonomy of Data Grids for Distributed Data Sharing, Management, and Processing,” ACM Computing Surveys, Vol.38 Article 3, March 2006.
[26]C. T. Yang, I. H. Yang, K. C. Li and S. Y. Wang, "Improvements on Dynamic Adjustment Mechanism in Co-Allocation Data Grid Environments," accepted and to appear in The Journal of Supercomputing, Springer, vol. 40, no. 3, pp. 269-280, June 2007.
[27]C. T. Yang, S. Y. Wang, and C. P. Fu, “A Dynamic Adjustment Mechanism for Data Transfer in Data Grids,” accepted and to appear in the Proceeding of Network and Parallel Computing (NPC2006), October 2006.
[28]C. T. Yang, S. Y. Wang, C. H. Lin, M. H. Lee, and T. Y. Wu, “Cyber-Transformer: A Toolkit for Files Transfer with Replica Management in Data Grid Environments,” Proceedings of the Second Workshop on Grid Technologies and Applications (WoGTA’05), pp. 73-80, December 2005.
[29]C. T. Yang, I. H. Yang, C. H. Chen and S. Y. Wang, "Implementation of a Dynamic Adjustment Mechanism with Efficient Replica Selection in Co-Allocation Data Grid Environments," Proceedings of the 21st Annual ACM Symposium on Applied Computing (SAC 2006) - Distributed Systems and Grid Computing (DSGC) Track, vol. 1, pp. 797-804, Dijon, France, April 23-27, 2006.
[30]C. T. Yang, I. H. Yang, K. C. Li and C. H. Hsu, "A Recursive-Adjustment Co-Allocation Scheme in Data Grid Environments," Distributed and Parallel Computing: 6th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2005, Lecture Notes in Computer Science, vol. 3719, pp. 40-49, Springer, October 2005.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top