The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (2008 vol.19)
pp: 1215-1223
ABSTRACT
Much of the recent literature shows a prevalance in the use of metaheuristics in solving a variety of problems in parallel and distributed computing. This is especially ture for problems that have a combinatorial nature, such as scheduling and load balancing. Despite numerous efforts, task scheduling remains one of the most challenging problems in heterogeneous computing environments. In this paper, we propose a new state transitionscheme , called the Duplication-based State Transition (DST) method specially designed for metaheuristics that can be used for the task scheduling problem in heterogeneous computing environments. State transition in metaheuristics is a key component that takes charge of generating variants of a given state. The DST method produces a new state by first overlapping randomly generated states with the current state and then the resultant state is refined by removing ineffectual tasks. The proposed method is incorporated into three different metaheuristics, GA, SA ans AIS. They are experimentally evaluated and are also compared with existing algorithms. The experimental results confirm DST?s promising impact on the performance of metaheuristics.
INDEX TERMS
Load balancing and task assignment, TC scheduling and synchronization, Scheduling and task partitioning, Multiprocessor Systems
CITATION
Young-Choon Lee, Albert Zomaya, "A Novel State Transition Method for Metaheuristic-Based Scheduling in Heterogeneous Computing Systems", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 9, pp. 1215-1223, September 2008, doi:10.1109/TPDS.2007.70815
REFERENCES
[1] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guideto the Theory of NP-Completeness. pp. 238-239, W.H. Freeman, 1979.
[2] H. Topcuoglu, S. Hariri, and M. Wu, “Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp.260-274, Mar. 2002.
[3] G.C. Sih and E.A. Lee, “A Compile-Time Scheduling Heuristic forInterconnection-Constrained Heterogeneous Processor Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-187, Feb. 1993.
[4] S. Ranaweera and D.P. Agrawal, “A Task Duplication Based Scheduling Algorithm for Heterogeneous Systems,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '00), pp. 445-450, May 2000.
[5] C.-I. Park and T.-Y. Choe, “An Optimal Scheduling Algorithm Based on Task Duplication,” IEEE Trans. Computers, vol. 51, no. 4, pp. 444-448, Apr. 2002.
[6] S. Darbha and D.P. Agrawal, “Optimal Scheduling Algorithm forDistributed-Memory Machines,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
[7] S.J. Kim and J.C. Browne, “A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures,” Proc. Int'l Conf. Parallel Processing (ICPP '88), vol. 2, pp. 1-8, Aug. 1988.
[8] D. Bozdag, U. Catalyurek, and F. Ozguner, “A Task Duplication Based Bottom-Up Scheduling Algorithm for Heterogeneous Environments,” Proc. Int'l Parallel and Distributed Processing Symp.(IPDPS '05), Apr. 2005.
[9] I. Ahmad and Y.-K. Kwok, “On Exploiting Task Duplication in Parallel Program Scheduling,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872-892, Sept. 1998.
[10] M.A. Palis, J.C. Liou, and D.S.L. Wei, “Task Clustering and Scheduling for Distributed Memory Parallel Architectures,” IEEETrans. Parallel and Distributed Systems, vol. 7, no. 1, pp.46-55, Jan. 1996.
[11] A.Y. Zomaya and G. Chan, “Efficient Clustering for Parallel Tasks Execution in Distributed Systems,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS '04), Apr. 2004.
[12] A.Y. Zomaya, C. Ward, and B. Macey, “Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 8, pp. 795-812, Aug. 1999.
[13] A.Y. Zomaya, C. Ward, and B. Macey, “An Evolutionary Approach for Scheduling in Parallel Processor Systems,” Proc.Third Int'l Symp. Parallel Architectures, Algorithms, and Networks (I-SPAN '97), pp. 369-375, Dec. 1997.
[14] S. Salleh and A.Y. Zomaya, Scheduling in Parallel Computing Systems: Fuzzy and Annealing Techniques. Kluwer Academic Publishers, 1999.
[15] C.-W. Chiang, Y.-C. Lee, C.-N. Lee, and T.-Y. Chou, “Ant Colony Optimisation for Task Matching and Scheduling,” IEE Proc. Computers and Digital Techniques, vol. 153, no. 6, pp. 373-380, Nov. 2006.
[16] A. Swiecicka, F. Seredynski, and A.Y. Zomaya, “Multiprocessor Scheduling and Rescheduling with Use of Cellular Automata and Artificial Immune System Support,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 3, pp. 253-262, Mar. 2006.
[17] A.M. Costa, P.A. Vargas, F.J. Von Zuben, and P.M. Franca, “Makespan Minimization on Parallel Processors: An Immune-Based Approach,” Proc. Congress on Evolutionary Computation (CEC'02), pp. 920-925, 2002.
[18] Y.K. Kwok and I. Ahmad, “Benchmarking the Task Graph Scheduling Algorithms,” Proc. First Merged Int'l Parallel Processing Symp./Symp. Parallel and Distributed Processing (IPPS/SPDP '98), pp. 531-537, 1998.
[19] F. Esponda, E.S. Ackley, S. Forrest, and P. Helman, “On-line Negative Databases,” Int'l J. Unconventional Computing, vol. 1, no. 3, pp. 201-220, 2005.
[20] U. Aickelin and S. Cayzer, “The Danger Theory and Its Application to Artificial Immune Systems,” Proc. First Int'l Conf. Artificial Immune Systems (ICARIS '02), pp. 141-148, Sept. 2002.
[21] J. Kim and P.J. Bentley, “Towards an Artificial Immune System for Network Intrusion Detection: An Investigation of Clonal Selection with a Negative Selection Operator,” Proc. Congress on Evolutionary Computation (CEC '01), vol. 2, pp. 1244-1252, May 2001.
[22] S. Garrett, “How Do We Evaluate Artificial Immune Systems?” Evolutionary Computation, vol. 13, no. 2, pp. 145-177, June 2005.
[23] L.N. de Castro and F.J. Von Zuben, “Learning and Optimization Using the Clonal Selection Principle,” IEEE Trans. Evolutionary Computation, vol. 6, no. 3, pp. 239-251, 2002.
[24] 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.
[25] R.E. Lord, J.S. Kowalik, and S.P. Kumar, “Solving Linear Algebraic Equations on an MIMD Computer,” J. ACM, vol. 30, no. 1, pp. 103-117, Jan. 1983.
[26] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool