Design and Implementation of a Parallel Ant System for Task Matching and Scheduling 范智欽、江傳文 ; 邱紹豐
E-mail: 9418552@mail.dyu.edu.tw
ABSTRACT
PC clusters have recently received much attention as cost-effective parallel platforms for scientific computations. A parallel program, which can be executed on a target cluster system, generally consists of a set of tasks (i.e. program segments). To effectively harness the computing power of the target cluster system, techniques for task matching and scheduling becomes vital important. In this dissertation, a parallel algorithm based on the Fast Ant System (FANT) is proposed. This algorithm, namely FANT-TMS, concentrates on properly allocating the tasks to the processing elements of the cluster system and sequencing the execution of the tasks. FANT-TMS is different from the previously proposed approaches in twofold. First, it employs an indirect representation scheme to represent a solution of the original problem. Second, it couples a local search procedure with a mechanism to improve the performance. FANT-TMS is evaluated through a comparison with the genetic algorithm (GA) based scheduling technique in terms of overall execution time of the parallel program. Simulation results show the efficiency and effectiveness of the proposed algorithm.
With regarded to the performance of the proposed local search algorithm, these experimental results also demonstrate that significant improvement over existing methods (such as FASTEST and TASK) can be obtained.
Keywords : PC clusters ; Task matching and scheduling ; Ant system ; Local Search ; Genetic Algorithms Table of Contents
目錄 封面內頁 簽名頁 授權書………...………iii 中文摘要………
……….……...…………...iv 英文摘要………...…….v 誌謝………
………..…….vi 目錄..……….……...vii 圖目錄…
………...ix 表目錄………....x 第一章 導論………..……..1 1.1 研究背景與動機……….1 1.2 研究目的與範圍……….4 1.3 章節介紹……….5 第二章 問題 塑模………..…..…6 2.1 平行程式模型………..………...…6 2.2 叢集運算系 統模型……….9 第三章 相關研究………..…11 3.1 傳統泛用啟發 式演算方法………..….11 3.2 螞蟻系統相關演算方法………...13 3.3 區域搜尋方法………
………...21 第四章 設計方法………..………25 4.1 狀態轉移規則設計.…………
………..25 4.2 區域搜尋方法設計………...26 4.3 費洛蒙濃度更新策略設計………
….…..30 第五章 實驗結果……….……….…34 5.1 單機實驗結果………
…...34 5.2 平行化實驗結果……….…..42 第六章 結論……….….……
…55 參考文獻………..57 REFERENCES
參考文獻 [1] T. C. Hu, "Parallel Sequencing and assembly Line Problems," Oper. Research, Vol. 19, No. 6, pp. 244-257, April 1989.
[2] R. Sethi, "Scheduling Graphs on Two Processors," SIAM J. Computing, Vol. 5, No. 1, pp. 73-82, March 1976.
[3] W. H. Kohler and K. Steiglitz, "Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems," J.
ACM, Vol. 21, No. 1, pp 140-156, January 1974.
[4] T. L. Adam, K. Chandy, and J. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, Vol. 17, No. 12, pp. 685-690, December 1974.
[5] T. Yang and A. Gerasoulis, "List Scheduling with and without Communication Delays," J. Parallel Computing, Vol. 19, No. 12, pp. 1321-1344, December 1993.
[6] H. EI-Rewini and T. Lewis, "Scheduling Parallel Programs onto Arbitrary Target Machines," J. Parallel and Distributed Computing, Vol. 9, No. 2, pp. 138-153, June 1990.
[7] B. Shirazi, M. Wang, and G. Pathak, "Analysis and Evaluation of Heuristic Methods for Static Scheduling," J. Parallel and Distributed Computing, Vol. 10, No. 3, pp. 222-232, March 1990.
[8] M. Y. Wu and D. D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, Vol. 1, No. 3, pp. 330-343, July 1990.
[9] J. Y. Colin and P. Chritienne, "C.P.M. Scheduling with Small Communication Delays and Task Duplication," Oper. Research, Vol. 39, No. 4, pp. 680-684, July 1991.
[10] T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 9, pp. 951-967, September 1994.
[11] M. AI-Mouhamed and A. AI-Mouhamed, "Performance Evaluation of Scheduling Precedence-Constrained Computations on Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 12, pp. 1317-1322, December 1994.
[12] H. EI-Rewini, H. Ali, and T. Lewis, "Task Scheduling in Multiprocessing Systems," Computer, Vol. 28, No. 12, pp. 27-37, December 1995.
[13] M. A. Palis, J. Liou, and D. S. L. Wei, "Task Clustering and Scheduling for Distributed Memory Parallel Architectures," IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 1, pp. 46-55, January 1996.
[14] Y. K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors,"
IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 5, pp. 506-521, May 1996.
[15] M. D. Natale and J. A. Stankovic, "Scheduling Distributed Real-Time Tasks with Minimum Jitter," IEEE Trans. Computers, Vol. 49, No. 4, pp.303-316, April 2000.
[16] L. Wang, H. J. Siegel, V. P. Roychowdhury, and A. A. Maciejewski, "Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach," J. Parallel and Distributed Computing, Vol. 47, No. 1, pp.8-22, November 1997.
[17] 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.
[18] M. Dorigo, and L. M. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Trans. Evolutionary Computation, Vol. 1, No. 1, pp. 53-66, April 1997.
[19] Y. K. Kwok and I. Ahmad, "Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm," J. Parallel and Distributed Computing, Vol. 47, No. 1, pp.58-77, November 1997.
[20] E. S. H. Hou, N. Ansari, and H. Ren, "A Genetic Algorithm for Multiprocessor Scheduling," IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 2, pp. 113-120, February 1994.
[21] J. H. Holland, Adaptation in Natural and Artificial Systems, Univ. of Michigan Press, Ann Arbor, 1975.
[22] E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons, 1989.
[23] Man Lin, Lars Karlsson, and Laurence Tianruo Yang, "Heuristic Techniques: Scheduling Partially Ordered Tasks in a Multi-processor Environment with Tabu and Genetic Algorithm," Proc. of the 7th International Conference on Parallel and Distributed Systems, pp.515-523, July 2000.
[24] V. Maniezzo and A. Colorni, "The Ant System Applied to the Quadratic Assignment Problem," IEEE Trans. on Knowledge and Data Engineering, Vol. 11, No. 5, pp. 769-778, September/October 1999.
[25] D. Merkle, M. Middendorf and H. Schmeck, "Ant Colony Optimization for Resource-Constrained Project Scheduling," IEEE Trans. on Evolutionary Computation, Vol. 6, No. 4, pp. 333-346, August 2000.
[26] E. D. Taillard, "FANT: Fast Ant System," Technical report IDSIA-46-98, IDSIA, Lugano, Switzerland, 1998.
[27] G. Gutin, and A. P. Punnen, The Traveling Salesman Problem and Its Variations, Springer, 2002.
[28] Thomas Stuzle, Holger Hoos, "MAX-MIN Ant System," Future Generation Computer Systems, Vol. 16, Issue. 8, pp.889-914, June 2001.
[29] Y. K. Kwok, and I. Ahmad, "FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors," IEEE Trans. Parallel and Distributed System, Vol. 10, No 2, pp. 147-159, February 1999.
[30] M. Y. Wu, W. Shu, and J. Gu, "Efficient Local Search for DAG Scheduling," IEEE Trans. Parallel and Distributed System, Vol. 12, No 6, pp.
617-627, June 2001.
[31] M. Randall and A. Lewis, "A parallel Implementation of Ant Colony Optimization," J. Parallel and Distributed Computing, Vol. 62, No. 9, pp. 1421-1432, September 2002.
