跳到主要內容

簡易檢索 / 詳目顯示

研究生: 沈思良
Sih-Liang Shen
論文名稱: 利用多項系統負載資訊進行動態P2P系統重組的策略研究
Runtime Reconfiguration Using I/O and CPU Profiler over Dynamic P2P Systems
指導教授: 王尉任
Wei-Jen Wang
口試委員:
學位類別: 碩士
Master
系所名稱: 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
畢業學年度: 97
語文別: 中文
論文頁數: 48
中文關鍵詞: 實體搬移動態重新配置負載平衡動態同儕網路系統
外文關鍵詞: dynamic reconfiguration, load balancing, dynamic P2P system, entity migration
相關次數: 點閱:10下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 網際網路的快速發展使得人們開始將電腦資源透過網路來共享以及整合,藉此讓全世界的電腦聚合成數群虛擬的超級電腦,並利用它們來解決過去受限於運算能力不足而被認為無法解決的複雜問題。然而在這些機器互相連接所形成的P2P網路中,常常會發生有節點加入或離開網路的情況,而且這些機器上的資源也會經常變動,因此要有效利用這個網路中的資源,動態重新配置資源來做負載平衡就會是比較好的方法。
    本研究提出一套數學模型和公式來判斷計算實體(例如行程、actor)的搬移時機。而且除了計算密集的應用程式之外,本研究還考慮了當此程式帶有資料檔案時,這些資料檔案經由網路傳輸所花費的時間及對效能的影響。本研究亦提出了債務的概念,來避免過度搬移的發生。另外本研究提出的公式具有可擴充性,可以在未來加入新型態的計算或儲存資源。


    As the evolution of the Internet continues, it is possible to share and integrate resources of computers in several different ways. The Internet aggregates all computers over the world as a whole and creates numerous groups of computers with great computing power. People can use them to solve many complicated problems which were considered too hard to be solved. However, those powerful computing resources are usually dynamic. There are often new arrivals and departures of computing nodes and constant changes of the computing resources on the hosts in the network. As a result, a P2P dynamic reconfiguration approach is more appropriate on such a system to achieve load balancing. Thus we can maximize the utilization of the resources in a self-adaptive manner.
    In this thesis, we propose a P2P, runtime reconfiguration model to judge whether or not a computing entity should migrate to improve overall performance on a given distributed computing environment. In addition to computation-intensive applications, the model also considers data-intensive applications which usually spend much time on I/O transmission. We also introduce the concept of “debt” to prevent a computing entity from frequent, unnecessary migrations which usually result from wrong migration decisions on an unstable computing environment. Our model is extensible: it is possible to add new types of resources as new model parameters because of the symmetry of the model parameters.

    摘要 i Abstract ii 目錄 iv 圖目錄 vi 表目錄 vii 一、緒論 1 1-1. 計算環境的演進 1 1-2. 負載平衡與動態重新配置 1 1-3. 研究動機與目標 3 1-4. 論文章節安排 3 二、研究背景知識與相關研究 5 2-1. 網格計算 5 2-2. 雲端運算 6 2-3. 動態P2P系統中的負載平衡策略 8 三、實體搬移的原則 10 3-1. 如何決定應用程式是否可以進行搬移 12 3-2. 與傳統計算密集程式的比較 17 3-3. 如何避免過多次數的搬移 18 四、實驗模擬及結果分析 21 4-1. 實驗模擬情境及目的 21 4-2. tIO變動對tsave的影響 22 4-3. ACPUlocal和ACPUremote變動對tsave的影響 23 4-4. AIOlocal和AIOremote變動對tsave的影響 25 4-5. ANETlr變動對tsave的影響 27 4-6. 計算密集程式的模擬實驗 28 4-7. αk與Debtk對tsave(k)的影響 33 五、結論與未來展望 36 5-1. 研究貢獻 36 5-2. 未來展望 36 參考文獻 38

    [1]K. E. Maghraoui. A Framework for the Dynamic Reconfiguration of Scientific Applications in Grid Environments, Rensselaer Polytechnic Institute, PhD thesis, 2007.
    [2]G. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.
    [3]I. Foster. What is the Grid? A Three Point Checklist,
    http://www.mcs.anl.gov/~itf/Articles/WhatIsTheGrid.pdf, 2002.
    [4]International Business Machines Corporation. IBM Solutions Grid for Business Partners: Helping IBM Business Partners to Grid-enable applications for the next phase of e-business on demand,
    http://joung.im.ntu.edu.tw/teaching/distributed_systems/documents/IBM_grid_wp.pdf, 2002.
    [5]CERN. The Grid Caf? -- The place for everybody to learn about grid computing,
    http://www.gridcafe.org/grid-in-30-sec.html, 2008.
    [6]I. Foster and C. Kesselman. The Globus project: a status report. Future Generation Computer Systems, 15(5–6):607–621, 1999.
    [7]E. Knorr, G. Gruman. What cloud computing really means,
    http://www.infoworld.com/d/cloud-computing/what-cloud-computing-really-means-031, 2008.
    [8]K. Danielson. Distinguishing Cloud Computing from Utility Computing,
    http://www.ebizq.net/blogs/saasweek/2008/03/distinguishing_cloud_computing/, 2008.
    [9]K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, pages 41–52, Aug. 2002.
    [10]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM ’01 Conference, pages 149–160, San Diego, California, August 2001.
    [11]A. R. Karthik. Load balancing in structured p2p systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), page 6pp., Berkeley, CA, 2003.
    [12]M. Harchol-Balter and A. B. Downey. Exploiting process lifetime distributions for dynamic load balancing, ACM Transactions on Computer Systems (TOCS), Volume 15, Issue 3, pages 253-285, New York, NY, USA, Aug. 1997, ACM Press.
    [13]SiSoftware, Sandra (the System ANalyser, Diagnostic and Reporting Assistant),
    http://sisoftware.net/index.html?dir=&location=pinformation
    [14]Lavalys, EVEREST,
    http://www.lavalys.com/products.php?ps=UE&page=9
    [15]NVIDIA, CUDA,
    http://www.nvidia.com/object/cuda_home.html

    QR CODE
    :::