Skip to main content
SpringerLink
Log in

Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2014)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 509))

Included in the following conference series:

  • 627 Accesses

Abstract

This paper is devoted to the problem of designing a computational system utilizing the minimal number of processors to ensure that the program is executed before the deadline. The program is represented by a direct acyclic graph where vertices correspond to jobs. The system is supposed to tolerate both hardware and software faults. The schedule of the program execution does not include the exact moments of job launch and termination, thus allowing to employ abstract models with various levels of detail to estimate the time of execution. A simulated annealing algorithm is proposed for this problem. The paper provides the proof of asymptotic convergence of the algorithm and an experimental evaluation. The algorithm is also applied to a practical problem of scheduling in radiolocation systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Antonenko, V.A., Chemeritsky, E.V., Glonina, A.B., Konnov, I.V., Pashkov, V.N., Podymov, V.V., Savenkov, K.O., Smeliansky, R.L., Vdovin, P.M., Volkanov, D.Y., Zakharov, V.A., Zorin D.A.: DYANA: an integrated development environment for simulation and verification of real-time avionics systems. In: European Conference for Aeronautics and Space Sciences (EUCASS), Munich (2013)

    Google Scholar 

  2. Avizienis, A., Laprie, J.C., Randell, B.: Dependability and its threats: a taxonomy. In: Building the Information Society, Proceedings IFIP 18th World Computer Congress, Toulouse, pp. 91–120 (2004)

    Google Scholar 

  3. Balashov, V.V., Balakhanov, V.A., Kostenko, V.A., Smeliansky, R.L., Kokarev, V.A., Shestov, P.E.: A technology for scheduling of data exchange over bus with centralized control in onboard avionics systems. Proc. Inst. Mech. Eng. Part G: J. Aerosp. Eng. 224(9), 993–1004 (2010)

    Article  Google Scholar 

  4. Eckhardt, D.E., Lee, L.D.: A theoretical basis for the analysis of multiversion software subject to coincident errors. IEEE Trans. Softw. Eng. 11, 1511–1517 (1985)

    Article  MATH  Google Scholar 

  5. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading (1989)

    Google Scholar 

  6. Hou, E.S., Hong, R., Ansari, N.: Efficient multiprocessor scheduling based on genetic algorithms. In: 16th Annual Conference of IEEE Industrial Electronics Society, IECON 1990, pp. 1239–1243. IEEE, November 1990

    Google Scholar 

  7. Jedrzejowicz, P., Czarnowski, I., Szreder, H., Skakowski, A.: Evolution-based scheduling of fault-tolerant programs on multiple processors. In: Rolim, J., et al. (eds.) Parallel and Distributed Processing. Lecture Notes in Computer Science, vol. 1586, pp. 210–219. Springer, Berlin (1999)

    Chapter  Google Scholar 

  8. Laprie, J.-C., Arlat, J., Beounes, C., Kanoun, K.: Definition and analysis of hardware- and software-fault-tolerant architectures. Computer 23, 39–51 (1990)

    Article  Google Scholar 

  9. Kalashnikov, A.V., Kostenko, V.A.: A parallel algorithm of simulated annealing for multiprocessor scheduling. J. Comput. Syst. Sci. Int. 47(3), 455–463 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kirkpatrick Jr., S., Gelatt, D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kostenko, V.A.: Design of computer systems for digital signal processing based on the concept of “open” architecture. Avtomatika i Telemekhanika 55(12), 151–162 (1994)

    Google Scholar 

  12. Kostenko, V.A., Romanov, V.G., Smeliansky, R.L.: Algorithms of minimization of hardware resources. Artif. Intell. 2, 383–388 (2000)

    Google Scholar 

  13. Kostenko, V.A.: Scheduling algorithms for real-time computing systems admitting simulation models. Program. Comput. Softw. 39(5), 255–267 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lundy, M., Mees, A.: Convergence of an annealing algorithm. Math. Program. 34(1), 111–124 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  15. Moore, M.: An accurate and efficient parallel genetic algorithm to schedule tasks on a cluster. In: 2003 Proceedings of the International Parallel and Distributed Processing Symposium, p. 5. IEEE (2003)

    Google Scholar 

  16. Orsila, H., Salminen, E., Hämäläinen, T.D.: Best practices for simulated annealing in multiprocessor task distribution problems. In: Simulated Annealing, pp. 321–342 (2008)

    Google Scholar 

  17. Qin, X., Jiang, H., Swanson, D.R.: An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. In: Proceedings of the International Conference on Parallel Processing 2002, pp. 360–368. IEEE (2002)

    Google Scholar 

  18. Qin, X., Jiang, H.: A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters. J. Parallel Distrib. Comput. 65(8), 885–900 (2005)

    Article  MATH  Google Scholar 

  19. Smelyansky, R.L., Bakhmurov, A.G., Volkanov, D.Y., Chemeritskii, E.V.: Integrated environment for the analysis and design of distributed real-time embedded computing systems. Program. Comput. Softw. 39(5), 242–254 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sprinthall, R.C.: Basic Statistical Analysis. Allyn and Bacon, Boston (2006)

    Google Scholar 

  21. Van Laarhoven, P.J., Aarts, E.H., Lenstra, J.K.: Job shop scheduling by simulated annealing. Oper. Res. 40(1), 113–125 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  22. Wasserman, P.D.: Neural computing: theory and practice. Van Nostrand Reinhold Co., New York (1989)

    Google Scholar 

  23. Wattanapongsakorn, N., Levitan, S.P.: Reliability optimization models for embedded systems with multiple applications. IEEE Trans. Reliab. 53, 406–416 (2004)

    Article  Google Scholar 

  24. Zorin, D.A., Kostenko, V.A.: Algorithm for synthesizing a reliable real-time computing system architecture. J. Comput. Syst. Sci. Int. 51(3), 410–417 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  25. Zorinl, D.A.: Scheduling signal processing tasks for antenna arrays with simulated annealing. In: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering (SYRCoSE), Kazan, pp. 122–127 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    Daniil A. Zorin & Valery A. Kostenko

Authors
  1. Daniil A. Zorin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valery A. Kostenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniil A. Zorin .

Editor information

Editors and Affiliations

  1. IMA, LISA, Angers, France

    Eric Pinson

  2. Polytechnic Institute of Setúbal, Setúbal, Portugal

    Fernando Valente

  3. Complutense University, Madrid, Spain

    Begoña Vitoriano

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zorin, D.A., Kostenko, V.A. (2015). Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17509-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17508-9

  • Online ISBN: 978-3-319-17509-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation