Skip to main content
SpringerLink
Log in

Performance Evaluation of Simulated Annealing-Based Task Scheduling Algorithms

  • Conference paper
  • First Online:
Information Management and Machine Intelligence (ICIMMI 2019)

Part of the book series: Algorithms for Intelligent Systems ((AIS))

Abstract

The performance of simulated annealing (SA)-based task scheduling algorithms is evaluated. First, various parameters of SA are varied, and it is seen how it affects the schedule length (SL). The parameters that are varied are initial temperature, number of iterations, initial clustering, and cooling schedule. Then, one SA-based task scheduling algorithm is selected and compared with other task scheduling algorithms. The algorithms selected for comparison are cluster pair priority scheduling (CPPS), dominant sequence clustering (DSC), edge zeroing (EZ), and linear clustering (LC). Random task graphs are used for comparison.

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 299.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 379.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.99
Price excludes VAT (USA)
  • Durable hardcover 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. Arora, N. (2012). Analysis and performance comparison of algorithms for scheduling directed task graphs to parallel processors. International Journal of Emerging trends in Engineering and Development, 4, 793–802.

    Google Scholar 

  2. de Carvalho, R. M., Lima, R. M. F., & de Oliveira, A. L. I. (2011). An efficient algorithm for static task scheduling in parallel applications. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC) (pp. 2313–2318).

    Google Scholar 

  3. Davidovic, T., & Crainic, T. G. (2006). Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Computers & Operations Research, 33, 2155–2177.

    MathSciNet  MATH  Google Scholar 

  4. Davidovic, T. Benchmark task graphs. http://www.mi.sanu.ac.rs/~tanjad/sched_results.htm.

  5. Drozdowski, M. (2009). Scheduling for parallel processing. Berlin: Springer.

    Google Scholar 

  6. Jin, S., Schiavone, G., & Turgut, D. (2008). A performance study of multiprocessor task scheduling algorithms. The Journal of Supercomputing, 43, 77–97.

    Google Scholar 

  7. Kim, S. J., & Browne, J. C. (1988). A general approach to mapping of parallel computation upon multiprocessor architectures. In: Proceedings of 1988 International Conference on Parallel Processing (vol. 3, pp. 1–8).

    Google Scholar 

  8. Kwok, Y. K., & Ahmad, I. (1999). Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59, 381–422.

    MATH  Google Scholar 

  9. Mishra, A., & Tripathi, A. K. (2014). Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling. Applied Mathematical Modelling, 38, 3456–3466.

    MathSciNet  MATH  Google Scholar 

  10. Mishra, A., & Tripathi, A. K. (2015). Complexity of a problem of energy efficient real-time task scheduling on a multicore processor. Complexity, 21(1), 259–267.

    MathSciNet  Google Scholar 

  11. Mishra, A., & Tripathi, A. K. (2014). A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling. Applied Mathematical Modelling, 38, 1929–1947.

    MathSciNet  MATH  Google Scholar 

  12. Mishra, A., & Mishra, P. K. (2016). A randomized scheduling algorithm for multiprocessor environments using local search. Parallel Processing Letters, 26, 1650002.

    MathSciNet  Google Scholar 

  13. Mishra, A., & Tripathi, A. K. (2011). An extension of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme. Journal of Information and Computing Science, 6, 83–96.

    Google Scholar 

  14. Mishra, P. K., Mishra, A., Mishra, K. S., & Tripathi, A. K. (2012). Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules. Applied Mathematical Modelling, 36, 6243–6263.

    MathSciNet  MATH  Google Scholar 

  15. Mishra, A., & Trivedi, P. (2019). Benchmarking the contention aware nature inspired metaheuristic task scheduling algorithms. Cluster Computing. https://doi.org/10.1007/s10586-019-02943-z.

    Article  Google Scholar 

  16. Mishra, K. S., & Tripathi, A. K. (2013). Task scheduling of a distributed computing software in the presence of faults. International Journal of Computer Applications, 72, 1–9.

    Google Scholar 

  17. Mishra, K. S., & Tripathi, A. K. (2014). Task scheduling of special types of distributed software in the presence of communication and computation faults. International Journal of Engineering and Computer Science, 3, 8752–8764.

    Google Scholar 

  18. Orsila, H., Salminen, E., & Hamalainen, T. (2013). recommendations for using simulated annealing in task mapping. Design Automation for Embedded Systems, 17, 53–85.

    Google Scholar 

  19. Sarkar, V. (1989). Partitioning and scheduling parallel programs for multiprocessors. Research Monographs in Parallel and Distributed Computing. Cambridge: MIT Press.

    Google Scholar 

  20. Singh, N., Kaur, G., Kaur, P., & Singh, G. (2012). Analytical performance comparison of BNP scheduling algorithms. Global Journal of Computer Science and Technology, 12, 11–24.

    Google Scholar 

  21. Sinnen, O. (2007). Task scheduling for parallel systems. Hoboken: Wiley.

    Google Scholar 

  22. Sriram, S., & Bhattacharyya, S. S.: (2009). Embedded multiprocessors: Scheduling and synchronization (2nd ed.). Boca Raton: CRC Press.

    Google Scholar 

  23. Vidyarthi, D. P., Sarkar, B. K., Tripathi, A. K., & Yang, L. T. (2009). Allocation of multiple tasks in DCS. Scheduling in distributed computing systems (pp. 1–94).

    Google Scholar 

  24. Yang, T., & Gerasoulis, A. (1991). A fast static scheduling algorithm for DAGs on an unbounded number of processors. In: Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (pp. 633–642).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Systems, Birla Institute of Technology and Science Pilani, Pilani, 333031, India

    Abhishek Mishra

  2. Department of Computer Sciences, School of Management Sciences, Varanasi, 221011, India

    Kamal Sheel Mishra

  3. Department of Computer Science, Department of Science and Technology, Center for Interdisciplinary Mathematical Sciences, Banaras Hindu University, Varanasi, 221005, India

    Pramod Kumar Mishra

Authors
  1. Abhishek Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamal Sheel Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pramod Kumar Mishra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abhishek Mishra .

Editor information

Editors and Affiliations

  1. Poornima Institute of Engineering and Technology, Jaipur, Rajasthan, India

    Dinesh Goyal

  2. Department of Automatics and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Bălaş

  3. CISCO Technologies, Milpitas, CA, USA

    Abhishek Mukherjee

  4. Universidade de Fortaleza, Fortaleza, Brazil

    Victor Hugo C. de Albuquerque

  5. Poornima Institute of Engineering and Technology, Jaipur, Rajasthan, India

    Amit Kumar Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mishra, A., Mishra, K.S., Mishra, P.K. (2021). Performance Evaluation of Simulated Annealing-Based Task Scheduling Algorithms. In: Goyal, D., Bălaş, V.E., Mukherjee, A., Hugo C. de Albuquerque, V., Gupta, A.K. (eds) Information Management and Machine Intelligence. ICIMMI 2019. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-15-4936-6_15

Download citation

Publish with us

Policies and ethics

Search

Navigation