Skip to main content

Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithms

  • Conference paper

Abstract

The paper deals with genetic algorithms for scheduling the tasks with non-negligible intertask communication. Three genetic algorithms for scheduling with the primary goal to minimise finishing time are reported. The basic genetic algorithm includes the reproduction, crossover and mutation operators. Its improved version has additional cloning operator that allows duplicated scheduling. The third algorithm is adaptive. The experiments describing influence of genetic operators’ probabilities, population size and number of generations on the resulting schedules, comparison of algorithms and the results obtained for different task granulation are discussed.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. El-Rewini, H., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems, Prentice Hall, 1994.

    Google Scholar 

  2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley, 1989.

    Google Scholar 

  3. Sinkovic, V., Lovrek, I.: An Approach to Massively Parallel Call and Service Processing in Telecommunications, Proceedings MPCS′94 Conference on Massively Parallel Computing Systems (MPCS): the Challenges of General-Purpose and Special-Purpose Computing, Ischia, Italy, pp. 533–537, 1994.

    Google Scholar 

  4. Sinkovic, V., Lovrek, I.: A Model Massively Parallel Call and Service Processing in Telecommunications, Journal of System Architecture — The EUROMICRO Journal, 43(1997), pp. 479–490.

    Article  Google Scholar 

  5. Nemeth, G., Lovrek, I., Sinkovic, V.: Scheduling Problems in Parallel Systems for Telecommunications, Computing, Vol. 58, No. 3, pp. 199–223, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  6. Sinkovic, V., Lovrek, I.: Load Balancing Potential of Distributed Parallel Call and Service Processing in Telecommunications, Proceedings Second International Conference on Massively Parallel Computer Systems MPCS 96, Ischia, Italy, pp. 366–373, 1996.

    Google Scholar 

  7. Lovrek, I., V. Sinkovic, Jezic, G.: Analysis of Call and Service Control in Telecommunications by using Genetic Algorithms, Proceedings KES 98 2nd International Conference on Knowledge-Based Intelligent Electronic Systems, pp. 302–310, Adelaide, Australia, 1998.

    Google Scholar 

  8. Selvakumar, C., Murthy, S.R.: Scheduling Precedence Constrained Task Graphs with Non-negligible Intertask Communication onto Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, Vol. 5, No. 3, pp. 328–336, 1994.

    Article  Google Scholar 

  9. Hou, E.S.H., Ansari, N., Ren, H.: A Genetic Algorithm for Multiprocessor Scheduling, IEEE Transactions on Parallel and Distributed System, Vol. 5, No. 2, pp. 113–120, 1994.

    Article  Google Scholar 

  10. Lovrek, I., Jezic, G.: A Genetic Algorithm for Multiprocessor Scheduling with Non-negligible Intertask Communication, Proceedings MIPRO 96 Computers in Telecommunications, Rijeka, Croatia, 1996.

    Google Scholar 

  11. Jezic, G., Kostelac, R., Lovrek, I., Sinkovic V.: Genetic Algorithms for Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors, Proceedings GP 98 Third Annual Genetic Programmnig Conference: Symposium on Genetic Algorithms, pp. 518, Madison, USA, 1998.

    Google Scholar 

  12. Sinkovic, V., Lovrek, I.: Performance of Genetic Algorithm Used for Analysis of Call and Service Processing in Telecommunications, Proceedings ICANNGA 95 International conference on Artificial neural networks and Genetic Algorithms, Ales, France, pp. 281–284, 1995.

    Google Scholar 

  13. Jezic, G., Kostelac, R.: The Use of Task Duplication in the Genetic Algorithm for Multiprocessor Scheduling with Non-negligible Intertask Communication, Proceedings MIPRO 97 Computers in Telecommunications, Rijeka, Croatia, pp. 2-204–2-209, 1997, (in Croatian).

    Google Scholar 

  14. Jezic, G., Kostelac, R.: The Influence of Different Granulation Sizes on the Task Scheduling in the Genetic Algorithm for Multiprocessor System, Proceedings SoftCOM 97, Split-Bari-Dubrovnik, Croatia-Italy, pp. 423–432, 1997, (in Croatian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Wien

About this paper

Cite this paper

Jezic, G., Kostelac, R., Lovrek, I., Sinkovic, V. (1999). Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6384-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6384-9_34

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83364-3

  • Online ISBN: 978-3-7091-6384-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics