The Design of Schedulers Based on the Weight of Sub-task Branches in the Grid Environment 鍾崇佑、邱紹豐
E-mail: [email protected]
ABSTRACT
Dynamic computing such as Grid computing and Cloud computing is regarded as the major approach to solve large-scale computing problems. It only requires a portal that users can use resource provided by distributed computing. The environment is dynamic in the sense that arrivals of user requests are issued continuously and the number of user requests is unknown in advance.
Traditional scheduling algorithms, such as genetic algorithm, tend to generate optimal solutions with high computing costs. They are not suitable for the dynamic environment because of their large scheduling costs and the user requests are unpredictable. The performance of the single scheduler system is degraded as the number of user requests increases. Due to the unpredictability of the user requests, the scheduler may match the requests with sub-optimal processing elements. The situation gets worse as the scheduler becomes the bottleneck because of employing some high cost scheduling algorithms. One of the solutions to cope with this problem is deploy multiple schedulers in the system to distribute the scheduling load. However, this scheme cause the rise of communication cost among schedulers which may not benefitted from the multi-scheduler design. In our research, we proposed a dynamic scheduling technique based on the resource competition strategy. We serialize the user requests according to the interrelationship among the sub-tasks of a request. The schedulers then compete for the available processing elements based on the acknowledgement of the status of the processing elements. If a scheduler successfully gain the right to a specific processing element, it sends the sub-task to the element for processing. Otherwise, it updates the status of the processing element locally and repeat the matching processing again. This design can efficiently avoid the communications among the schedulers and our simulation results show the system has overwhelm advantage over the traditional single-scheduler systems.
Keywords : resource competition、dynamic scheduling、DAG、Grid computing Table of Contents
封面內頁 簽名頁 中文摘要 iii ABSTRACT iv 誌謝 vi 目錄 vii 圖目錄 ix 表目錄 xi 第一章 緒論 1 1.1 研究動機與背景 1 1.2 論 文架構 4 第二章 相關研究 6 2.1 網格運算 6 2.2 GridSim 9 2.3 有向非循環圖 12 2.4 排程演算法 13 2.4.1 先到先服務 13 2.4.2 最短工作優先 13 2.4.3 最高回應率優先 14 2.4.4 最多連外分支優先 15 2.4.5 基因演算法 17 2.4.6 螞蟻系統 19 2.5 DAG圖形產 生器 21 2.6 資源競爭策略 24 第三章 研究方法 28 3.1 使用者請求與子工作 28 3.2 子工作序列化 31 3.3 資源競爭策略 34 3.3.1 處理單元 35 3.3.2 區域排程器 36 3.3.3 請求 37 3.3.4 回應 40 3.4 工作匹配 41 第四章 實驗結果 44 4.1 DAG產生器 44 4.2 實驗 假設 46 4.3 排程器與處理單元數量實驗 46 4.4 子工作數量差異 50 4.5 分支度變化實驗 54 第五章 結論與未來發展 57 5.1 結 論 57 5.2 未來展望 58 參考文獻 60
REFERENCES
[1]Malathi, M., and T. John Eng. Coll., “Cloud computing concepts,” 3rd International Conference on Electronics Computer Technology (ICECT), Vol.6 , pp. 236 – 239, April 2011.
[2]John T. Moy, “OSPF: anatomy of an Internet routing protocle. Addison-Wesley(5th),” ( ISBN 0-201-63472-4).
[3]OSCAR, H. IBARRA, and CHUL E. KIM., “Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors,”Journal of the ACM (JACM) ,Vol.24 Issue 2, pp.280-289, April 1977.
[4]Domenico Talia, “The Open Grid Services Architecture: Where the Grid Meets the Web,” IEEE Internet Computing, pp. 67-71, November and December 2002.
[5]邱紹豐、欉振坤，“在網格環境中動態排程最佳化問題之研究”，大葉大學資訊工程學系碩士論文， 2006年。
[6] http://setiathome.berkeley.edu/.
[7]Luis Ferreira, Fabiano Lucchese, Tomoari Yasuda, Chin Yau Lee, Carlos Alexandre Queiroz, Elton Minetto, and Antonio Saverio Rincon Mungioli ,”Grid Computing in Research and Education,” IBM Redbook ( ISBN 0-738-49175-6) .
[8]Foster, I., Yong Zhao, Raicu, I., and Shiyong Lu, “Cloud Computing and Grid Computing 360-Degree Compared,” Grid Computing Environments Workshop, pp. 1-10, November, 2008.
[9] http://www.cloudbus.org/gridsim/.
[10]Rajkumar Buyya, and Manzur Murshed,“GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing,” Vol. 14, No. 13, pp. 1175-1220, Journal 2002.
[11]Simon Handley, “On the use of a directed acyclic graph to represent a population of computer programsm,” Proceedings of the First IEEE Conference on Evolutionary Computation, vol. 1, pp. 154 - 159 1994.
[12]Volker Hamscher, Uwe Schwiegelshohn, Achim Streit, and Ramin Yahyapour, “A Genetic Algorithm for Multiprocessor Scheduling,”
GRID 2000, LNCS 1971, pp. 191 - 202, 2000.
[13]Silberschatz, A.; Galvin, P.B.; Gagne, G. , “Operating Systems Concepts (7th ed.) ,” (ISBN 0-471-69466-5).
[14]ChungNan Lee, ChuanWen Chiang, and MinFong Horng, “Collaborative Web Computing Environment: An Infrastructure for Scientific Computation,” IEEE Internet Computing, pp. 27-35, March and April 2000.
[15]Andy S. Chiou, and Chen-Kun Tsung, “Dynamic Scheduling for Jobs in the Grid Environment,” in Proceedings of the 3rd International Confe-rence on Cybernetics and Information Technologies, Systems and Appli-cations, pp. 288-292, July 2006.
[16]Edwin S. H. Hou, Ninvan Ansari and Hong Ren, “ A Genetic Algorithm for Multiprocessor Scheduling, ” IEEE Transactions on Parallel and Distributed Systems, VOL. 5, NO. 2, February 1994.
[17]Chuan-Wen Chiang, “Two Novel Genetic Operators for Task Matching and Scheduling in Heterogeneous Computing Environments,”
Journal of Internet Technology, Vol. 13 ,No. 5, pp.773-784 , September 2010.
[18]Yu-Kwong Kwok ,and Ishfaq Ahmad, “Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors using A Parallel Genetic Algorithm,
” Journal of Parallel and Distributed Computing ,Vol. 47, NO. 1, pp. 58-77, November 1997.
[19]M. Dorigo, V. Maniezzo, and A. Colorni, “Ant System: Optimization by a Colony of Cooperating Agents,” IEEE Trans. System, Man and Cybernetics-Part B: Vol. 26, No. 1, February 1996.
[20]Daniel Merkle, Martin Middendorf, and Hartmut Schmeck, “Ant Colony Optimization for Resource-Constrained Project Scheduling,”
IEEE Transactions on Evolutionary Computation, VOL. 6, NO. 4, pp.333-346, August 2002.
[21]V. Maniezzo, and A. Colorni, “ The ant system applied to the quadratic assignment problem ,” IEEE Transactions on Knowledge and Data Engineering, Vol.11 , NO.5 , pp 769-778, Sep/Oct 1999.
[22] http://www.thefullwiki.org/Ant_colony_algorithm#cite_note-3.
[23] http://www.loria.fr/~suter/OTAPHE/index.en.html.
[24]Andy S. Chiou, and Wenjiun Lin,“Using Resource Competition Strategy to Achieve Distributive Scheduling in the Grid and Cloud Computing Environments,” Annual International Conference on Advances in Distributed & Par, pR79, November 2010.
