Please use this identifier to cite or link to this item:
Analysis of the Computational Grid Resource Topology with Internet Characteristics
|關鍵字:||grid computing;網格運算;grid resource;網格資源||出版社:||資訊科學系所||引用:|| Top 500 Supercomputer Sites - Top 500 List For November 2005. [Online]. Available: http://www.top500.org  Internet Traffic Report - Internet Global Response Time 2007. [Online]. Available: http://www.internettrafficreport.com/  M. Faloutsos, P. Faloutsos, and C.Faloutsos, “On power-law relationships of the internet topology,” in SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, (New York, NY, USA), pp. 251-262, ACM Press, August 1999.  A.-L. Barabasi and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, pp. 509-512, October 1999.  A. Medina, I. Matta, and J. Byers, “On the origin of power laws in internet topologies,” SIGCOMM Comput. Commun. Rev., vol. 30, pp. 18-28, April 2000.  A. Medina, A. Lakhina, I. Matta, and J. Byers, “Brite: Boston university representative internet topology generator.” [Online]. Available: http://www.cs.bu.edu/brite/index.html  H. Arikawa, K. Fujikawa, and H.Sunahara, “A node selection mechanism based on the node usage pattern on campus grid,” in Communications, Computers and signal Processing, 2003.PACRIM. 2003 IEEE Pacific Rim Conference on, vol. 1, pp. 217-220, August 2003.  S. Goteti and J. Subhlok, “Communication pattern based node selection for shared networks,” in Autonomic Computing Workshop, 2003, pp. 69-76, June 2003.  C. Liu, L. Yang, I. Foster, and D. Angulo, “Design and evaluation of resource selections framework for grid applications,” in High Performance Distributed Computing, 2002.HPDC-11 2002.Proceedings.11th IEEE International Symposium on, pp. 63-72, July 2002.  R. Raman, M. Livny, and M. Solomon, “Matchmaking: distributed resource management of high throughput computing,” in High Performance Distributed Computing, 1998. Proceedings. The Seventh International Symposium on, pp. 140-146, July 1998.  M. Litzkow, M. Livny, and M. Mutka, ”Condor-a hunter of idle workstations,” in Distributed Computing Systems, 1988., 8th International Conference on, pp. 104-111, June 1988.  W. Zhang, B. Fang, H. He, H. Zhang, and M. Hu, “Multisite resource selection and scheduling algorithm on computational grid,” in Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, p. 105, April 2004.  P. Kolano, “Surfer: an extensible pull-based framework for resource selection and ranking,” in Cluster Computing and the Grid, 2004.CCGrid 2004. IEEE International Symposium on, pp. 563-571, April 2004.  T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. MIT Press/Mcgraw-Hill, 1990.  J. Ullman, “NP-Complete scheduling problems,” Journal of Computing System Science, vol. 10, pp. 384-393, 1975.  Uei-Ren Chen, Chien-Hsun Wang, and Woei Lin, “Average Schedule Length and Resource Selection Policies on Computational Grids,” Springer''s Lecture Notes in Computer Science, vol. 3947, May 2006, pp. 63-72.  T. L. Adam, K. M. Chandy, and J. R. Dickson, ” A Comparison of list schedules for parallel processing systems,” Commun. ACM, vol. 17, pp. 685-690, Decenber 1974.  I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organization,” The International Journal of High Performance Computing Applications, vol. 15, pp. 200-222, Fall 2001.  E. W. Weisstein., “Maximum independent set problem.” [Online]. Available: http://mathworld.wolfram.com/MaximumIndependentSetProblem.html  GT-ITM Project - Modeling Topology of Large Internetworks. [Online].Available: http://www.cc.gatech.edu/projects/gtitm/  B. M. Waxman, “Routing of multipoint connections,” IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617-1622, December 1988.  E. W. Zegura, K. L. Calvert, and M. J. Donahoo., “A quantitative comparison of graph-based models for internet topology,” IEEE/ACM Transactions on Networking, vol. 5, no. 6, pp. 770-783, December 1997.  G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, “Power laws and the as-level internet topology,” IEEE/ACM Transactions on Networking, vol. 11, no. 4, pp. 514-524, August 2003.  R. V. Hogg and E. A. Tanis, Eds., Probability and statistical inference, 4th ed. Macmillan Publishing Company, 1993.||摘要:||
論文中模擬出網格運算整個執行環境, 包括環境中的網路 (包含傳輸節點以及連線)、計算資源, 以及想要利用網格運算去解決的大型問題。 並且採用現實世界的真實數據：根據前500大超級電腦的計算能力的分佈曲線圖 , 模擬出計算能力並且等比例縮放以分配到網格運算環境中的資源。 並且根據Internet Traffic Report 對於全球七大洲頻寬的統計, 去其中取得地球的七大洲頻寬分佈曲線, 將其等比例縮放之後分配到網格運算環境中的頻寬。
而在資源的安排上, 也利用七大洲的分佈, 將資源依照七大洲的超級電腦的分佈比例, 分配到各大洲之內。 並且依照這個比例去要求使用網格運算, 佔有最多超級電腦比例的北美洲將會最為頻繁的要求使用網格運算。最後再將網格運算的計算導向問題、通訊導向問題配合不同的計算導向資源、通訊導向資源來跑模擬程式, 以求全面性的模擬到全部可能的情形。
以上列真實世界的數據模擬網格運算, 最後統計得到一組參數比例。 以該參數比例為標準： 標準以上可以則可以使用網格運算去幫助快速解決大型問題, 標準以下則反倒不如使用個人電腦較有效率。
Keyword: grid computing, grid resource
In the thesis, we investigate the efficiency of the resource selection policy of the grid resource in our grid computing environment in the situation of different kind of problem and resource by simulating.
We simulate the entire grid environment including the network (routing nodes and links included), resource, and the problem which we want to solve by grid computing. We adapt the realistic computing ability and communication ability data to our computing resource and network resource according to the Top500 Supercomputer statistics data and the network data from Internet Traffic Report. It gathers statistics of response time of seven continents in the world. We reprocess the data and adapt the data to our network communication ability. Finally, we run simulation and get a ratio of parameters. The ratio helps us determine whether an application is suitable for grid computing. High ratios indicate that grid computing can increase the efficiency. Low ratios indicate, otherwise, that grid computing does not help at all.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.