This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling
September 2004 (vol. 15 no. 9)
pp. 824-834

Abstract—We have developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. Our approach requires minimal problem specific information and no problem specific operators or repair mechanisms. Key features of our system include a flexible, adaptive problem representation and an incremental fitness function. Comparison with traditional scheduling methods indicates that the GA is competitive in terms of solution quality if it has sufficient resources to perform its search. Studies in a nonstationary environment show the GA is able to automatically adapt to changing targets.

[1] I. Ahmad and M.K. Dhodhi, Multiprocessor Scheduling in a Genetic Paradigm Parallel Computing, vol. 22, pp. 395-406, 1996.
[2] I. Ahmad and Y. Kwok, On Exploiting Task Duplication in Parallel Program Scheduling IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872-892, Sept. 1998.
[3] M.A. Al-Mouhamed, Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs IEEE Trans. Software Eng., vol. 16, no. 12, pp. 1390-1401, Dec. 1990.
[4] S. Ali, S.M. Sait, and M.S.T. Benten, GSA: Scheduling and Allocation Using Genetic Algorithm Proc. EURO-DAC '94, pp. 84-89, 1994.
[5] J.D. Bagley, The Behavior of Adaptive Systems which Employ Genetic and Correlation Algorithms PhD dissertation, Univ. of Michigan, 1967.
[6] J. Branke, Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems Proc. Congress on Evolutionary Computation, pp. 1875-1882, 1999.
[7] D.S. Burke, K.A. De Jong, J.J. Grefenstette, C.L. Ramsey, and A.S. Wu, Putting More Genetics into Genetic Algorithms Evolutionary Computation, vol. 6, no. 4, pp. 387-410, 1998.
[8] H.G. Cobb, An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments Technical Report AIC-90-001, Naval Research Lab., Washington DC, 1990.
[9] R.C. Correa, A. Ferreira, and P. Rebreyend, Scheduling Multiprocessor Tasks with Genetic Algorithms IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 8, pp. 825-837, 1999.
[10] K.A. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems PhD dissertation, Univ. of Michigan, 1975.
[11] K. Deb and D.E. Goldberg, An Investigation of Niche and Species Formation in Genetic Function Optimization Proc. Int'l Conf. Genetic Algorithms, pp. 42-50, 1989.
[12] M.K. Dhodhi, I. Ahmad, and I. Ahmad, A Multiprocessor Scheduling Scheme Using Problem-Space Genetic Algorithms Proc. IEEE Int'l Conf. Evolutionary Computation, pp. 214-219, 1995.
[13] H. El-Rewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
[14] L.J. Eshelman, R.A. Caruana, and J.D. Schaffer, Biases in the Crossover Landscape Proc. Third Int'l Conf. Genetic Algorithms, pp. 10-19, 1989.
[15] S. Forrest and M. Mitchell, Relative Building-Block Fitness and the Building-Block Hypothesis Foundations of Genetic Algorithms 2, pp. 109-126, 1992.
[16] R.W. Franceschini, A.S. Wu, and A. Mukherjee, Computational Strategies for Disaggregation Proc. Ninth Conf. Computer Generated Forces and Behavioral Representation, 2000.
[17] D.R. Frantz, Non-Linearities in Genetic Adaptive Search PhD dissertation, Univ. of Michigan, Ann Arbor, 1972.
[18] D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
[19] D.E. Goldberg, B. Korb, and K. Deb, Messy Genetic Algorithms: Motivation, Analysis, and First Results Complex Systems, vol. 3, pp. 493-530, 1989.
[20] D.E. Goldberg and R.E. Smith, Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy Proc. Int'l Conf. Genetic Algorithms, pp. 59-68, 1987.
[21] J.J. Grefenstette, Genetic Algorihtms for Changing Environments Proc. Conf. Parallel Problem Solving from Nature (PPSN), vol. 2, pp. 137-144, 1992.
[22] Evolvability in Dynamic Fitness Lanscapes: A Genetic Algorithm Approach Proc. Conf. Congress on Evolutionary Computation (CEC), pp. 2031-2038, 1999.
[23] G.R. Harik, Learning Gene Linkage to Efficiently Solve Problems of Bounded Difficulty Using Genetic Algorithms PhD dissertation, Univ. of Michigan, Ann Arbor, 1997.
[24] J.H. Holland, Adaptation in Natural and Artificial Systems. Univ. of Michigan Press, 1975.
[25] E.S. 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, 1994.
[26] T.C. Hu, Parallel Sequencing and Assembly Line Problems Operations Research, vol. 19, no. 6, pp. 841-848, 1961.
[27] H. Kita, Y. Yabumoto, N. Mori, and Y. Nishikawa, Multi-objective Optimization by Means of the Thermodynamical Genetic Algorithm Proc. Conf. Parallel Problem Solving from Nature, pp. 504-512, 1996.
[28] B. Kruatrachue and T.G. Lewis, Duplication Scheduling Heuristic, a New Precedence Task Scheduler for Parallel Systems Technical Report 87-60-3, Oregon State Univ., 1987.
[29] B. Kruatrachue and T. Lewis,"Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
[30] Y. 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, 1997.
[31] Y. Kwok and I. Ahmad, Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors ACM Computing Surveys, vol. 31, no. 4, pp. 406-471, 1999.
[32] W.B. Langdon and R. Poli, Fitness Causes Bloat Soft Computing in Eng. Design and Manufacturing, pp. 13-22, 1997.
[33] J.R. Levenick, Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology Proc. Fourth Int'l Conf. Genetic Algorithms, pp. 123-127, 1991.
[34] W. Liles and K. De Jong, The Usefulness of Tag Bits in Changing Envrionments Proc. Congress on Evolutionary Computation, pp. 2054-2060, 1999.
[35] F.G. Lobo, K. Deb, D.E. Goldberg, G. Harik, and L. Wang, Compressed Introns in a Linkage Learning Genetic Algorithm Proc. Third Conf. Genetic Programming, pp. 551-558, 1998.
[36] J.D. Lohn, G.L. Haith, S.P. Columbano, and D. Stassinopoulos, A Comparison of Dynamic Fitness Schedules for Evolutionary Design of Amplifiers Proc. First NASA/DoD Workshop Evolvable Hardware, pp. 87-92, 1999.
[37] B.S. Macey and A.Y. Zomaya, A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs Proc. Joint 12th Int'l Parallel Processing Symp. and Ninth Symp. Parallel and Distributed Prog., pp. 538-541, 1998.
[38] H.A. Mayer, ptGAs: Genetic Algorithms Using Promoter/Terminator Sequences PhD dissertation, Univ. of Salzburg, Germany, 1997.
[39] N. Mori, H. Kita, and Y. Nishikawa, Adaptation to a Changing Environment by Means of the Thermodynamical Genetic Algorithm Proc. Conf. Parallel Problem Solving from Nature, pp. 513-522, 1996.
[40] J. Paredis, The Symbiotic Evolution of Solutions and Their Representations Proc. Sixth Int'l Conf. Genetic Algorithms, pp. 359-365, 1995.
[41] R.E. Smith, Diploidy Genetic Algorithms for Search in Time Varying Environments Proc. Ann. Southeast Regional Conf. ACM, pp. 175-179, 1987.
[42] T. Soule and A.E. Ball, A Genetic Algorithm with Multiple Reading Frames Proc. Genetic and Evolutionary Computation Conf., 2001.
[43] T. Soule, J.A. Foster, and J. Dickinson, Code Growth in Genetic Programming Genetic Programming, Cambridge, Mass.: MIT Press, pp. 215-233, 1996.
[44] T. Tsuchiya, T. Osada, and T. Kikuno, Genetic-Based Multiprocessor Scheduling Using Task Duplication Microprocessors and Microsystems, vol. 22, pp. 197-207, 1998.
[45] A.S. Wu, Non-Coding Segments and Floating Building Blocks for the Genetic Algorithm PhD dissertation, Univ. of Michigan, Ann Arbor, 1995.
[46] A.S. Wu and I. Garibay, The Proportional Genetic Algorithm: Gene Expression in a Genetic Algorithm Genetic Programming and Evolvable Machines, vol. 3, no. 2, pp. 157-192, 2002.
[47] A.S. Wu and R.K. Lindsay, Empirical Studies of the Genetic Algorithm with Non-Coding Segments Evolutionary Computation, vol. 3, no. 2, pp. 121-147, 1995.
[48] A.S. Wu and R.K. Lindsay, A Comparison of the Fixed and Floating Building Block Representation in the Genetic Algorithm Evolutionary Computation, vol. 4, no. 2, pp. 169-193, 1996.
[49] M.Y. Wu and D.D. Gajski,"Hypertool: A programming aid for message-passing systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
[50] 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.

Index Terms:
Genetic algorithm, task scheduling, parallel processing.
Citation:
Annie S. Wu, Han Yu, Shiyuan Jin, Kuo-Chi Lin, Guy Schiavone, "An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 9, pp. 824-834, Sept. 2004, doi:10.1109/TPDS.2004.38
Usage of this product signifies your acceptance of the Terms of Use.