跳到主要內容

臺灣博碩士論文加值系統

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

詳目顯示

: 
twitterline
研究生:陳志賢
研究生(外文):Chen,Zhi-Xian
論文名稱:以分群工作排程方法發展高回應性之志願計算系統
論文名稱(外文):Developing Responsive Volunteer Computing System using Group-Based Scheduling Approach
指導教授:陳隆彬陳隆彬引用關係
指導教授(外文):Chen,Lung-Bin
口試委員:吳毅成林秉宏
口試委員(外文):Wu,Yi-ChengLin,Bing-Hung
口試日期:2012-06-26
學位類別:碩士
校院名稱:東海大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2012
畢業學年度:100
語文別:中文
論文頁數:30
中文關鍵詞:分散式系統志願計算工作排程
外文關鍵詞:Distributed systemsVolunteer computingTask scheduler
相關次數:
  • 被引用被引用:1
  • 點閱點閱:127
  • 評分評分:
  • 下載下載:7
  • 收藏至我的研究室書目清單書目收藏:0
建置和維護一個能處理龐大計算需求的分散式系統是一個高複雜度與高成本的工作。志願計算技術運用大量的志工電腦以平行運算來有效率地完成計算工作,此種模式已被許多科學計畫證實有相當良好的成效。志願計算系統的效能主要取決於志工電腦的有效性與可靠度,本論文探討個別電腦的有效性的差異性對於系統整體效能的影響。我們提出志工電腦的分群管理機制,以spot-checking 來檢視志工電腦的有效性並加以分群。我們發展新的分群排程方法,將一組具有關聯性的工作副本分配給同一群組的志工電腦,以降低志工電腦之間的效能差異性對整組工作完成時間的影響,進而增強系統回應性與減少專案的總完成時間。
Build and maintain a distributed systems to process the huge computing needs is a high complexity and high cost of the work. Volunteer computing technology to use a lot of volunteer computer parallel computing power to efficiently complete the calculation ,and this model have been many scientific projects proved to have very good results. Volunteer computing system performance depends primarily on the volunteer computer availability and reliability, this paper examines the impact of the differences of individual computers, the availability of the overall system performance. We propose that the clustering of volunteer computer management system, the use of spot in-checking technology to view the volunteer computer availability and clustering. We have developed a new clustering scheduling method, a group has an associated workunit are allocated to the same group of volunteer computers, in order to reduce the impact of the performance difference between the volunteer computer on the entire group of task completed, and indirectly enhanced system responsiveness and reduce project completion time.
目錄
摘要 I
ABSTRACT II
圖目錄 V
第一章 簡介 1
第二章 背景 3
2.1 BOINC志願計算平台 3
2.2 BOINC工作排程方法 6
2.3 相關研究 7
2.3.1 志工電腦能力分析 8
2.3.2 以可信度分群 8
2.3.3 怠惰者與最佳副本數量 8
第三章 群組化志願計算 10
3.1 志工電腦的能力不一致效應 10
3.2 志工電腦積分計算 14
第四章 系統設計與實作 15
4.1 系統架構 15
4.1.1 Gbvc元件 16
4.1.2 Gbvc_WorkGenerator元件 17
4.1.3 Gbvc_Scheduler元件 19
4.2 系統實作 20
4.2.1 實作Gbvc_Group元件 20
4.2.2 實作Gbvc_WorkGenerator元件 21
4.2.3 實作Gbvc_Scheduler元件 22
第五章 實驗結果 23
第六章 討論與未來工作 27
參考文獻 28

[1]SanghoYi,DerrickKondo,and David P.Anderson, ”Toward Real-time Many-Task Applications on Large Distributed System,” European Conference on Parallel and Distributed Computing (Euro-Par), August, 2010.
[2]BOINC - 维基百科
http://zh.wikipedia.org/wiki/BOINC
[3] Unofficial BOINC Wiki
http://www.­boinc-­wiki.­info
[4]KanWatanabe,MasaruFukushi,SusumuHoriguchi, ”Optimal Spot-checking for Computation Time Minimization in Volunteer Computing,” JOURNAL OF GRID COMPUTINGVolume 7, Number 4, 575-600, DOI: 10.1007/s10723-009-9125-4.
[5]Berkeley Open Infrastructure for Network Computing (BOINC)
http://boinc.berkeley.edu
[6] Eric Martin Heien,David P. Anderson,KenichiHagihara,”Computing Low Latency Batches with Unreliable Workers in Volunteer Computing Environments,” J Grid Computing, DOI 10.1007/s10723-009-9131-6.
[7]Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David P. Anderson,” Towards Real-Time, Volunteer Distributed Computing,” Cluster, Cloud and Grid Computing (CCGrid), 2011 11th IEEE/ACM International Symposium on.
[8] Watanabe, K. and Fukushi, M. ,”Generalized Spot-checking for Sabotage-tolerance in Volunteer Computing Systems,” Proc. 10th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid2010 ), pp.655–660 (2010).
[9] Watanabe, K., Fukushi, M. and Horiguchi, S, ”Expected-credibility-based Job Scheduling for Reliable Volunteer Computing,” IEICE Trans. Inf. Syst., Vol.E93-D, No.2, pp.306–314 (2010).
[10] Kan Watanabe, Masaru Fukushi and Michitaka Kameyama, ” Adaptive Group-Based Job Scheduling for High Performance and Reliable Volunteer Computing,” Journal of Information Processing Vol. 19 39–51 (Feb. 2011)
[11] Jason Sonnek, Abhishek Chandra, and Jon B. , ” Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures,” IEEE Transactions on parallel and distributed systems, VOL. 18, NO. 11, NOVEMBER 2007
[12] David P. Anderson, Eric Korpela, Rom Walton, ”High-Performance Task Distribution for Volunteer Computing,” First IEEE International Conference on e-Science and Grid Technologies. 5-8 December 2005, Melbourne
[13] A. Chien, B. Calder, S. Elbert, K. Bhatia, ”Entropia:architecture and performance of an enterprise desktopgrid system,” Journal of Parallel and Distributed Computing 63, 5. P.597-610, May 2003
[14] David P. Anderson, “BOINC: A System for Public-Resource Computing and Storage,” 5th IEEE/ACM International Workshop on Grid Computing. November 8, 2004, Pittsburgh, USA.
[15] W. Du, J. Jia, M. Mangal, and M. Murugesan, “Uncheatable Grid Computing,” Proc. 24th IEEE Int’l Conf. Distributed Computing Systems (ICDCS ’04), pp. 4-11, Mar. 2004.
[16] Sarmenta, L.F.G. ,”Sabotage-Tolerance Mechanisms for Volunteer Computing Systems, ” Future Generation Computer Systems, Vol.18, No.4, pp.561–572 (2002).
[17] D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, ”SETI@home: An Experiment in Public-Resource Computing,” Communications of the ACM, 45(11):56–61, 2002.
[18] D. Molnar, “The SETI@Home Problem,” ACM Crossroads, Sept. 2000.
[19] SETI@home
http://setiathome.berkeley.edu/
[20] B. Alunkal, I. Veljkovic, G. von Laszewski, and K. Amin, ”Reputation-Based Grid Resource Selection,” Proc. Workshop Adaptive Grid Middleware (AGridM ’03), 2003.
[21] Folding@home
Distributing Computing Project, http://folding.stanford.edu, 2007.
[22] L.F.G. Sarmenta, “Sabotage-Tolerance Mechanisms for Volunteer Computing Systems,” Proc. First ACM/IEEE Int’l Symp. Cluster Computing and the Grid (CCGrid ’01), 2001.
[23] S. Zhao and V. Lo, “Result Verification and Trust-Based Scheduling in Open Peer-to-Peer Cycle Sharing Systems,” Proc. Fifth IEEE Int’l Conf. Peer-to-Peer Computing (P2P ’05), Sept. 2005.
[24] P. Resnick, R. Zeckhauser, E. Friedman, and K. Kuwabara, “Reputation Systems,” Comm. ACM, vol.43, no.12, pp.45-48, 2000.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top