Skip to main content

A Review of Dynamic Scheduling Algorithms for Homogeneous and Heterogeneous Systems

  • Conference paper
  • First Online:
System and Architecture

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 732))

Abstract

The dynamic scheduling algorithms are widely used to evaluate the performance of homogeneous and heterogeneous systems in terms of QoS parameters such as scheduling length, execution time, load imbalance factor and many more. Over the time, many dynamic scheduling policies were introduced which are designed to achieve their goal such as efficient utilization of process elements, minimization of resources idleness, or determining the total execution time. In this paper, we analyzed different aspects in dynamic scheduling algorithm and numerous issues in various levels of the homogeneous and heterogeneous systems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
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. Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406–471 (1999)

    Article  Google Scholar 

  2. Singh, K., Alam, M., Sharma, S.K.: A survey of static scheduling algorithm for distributed computing system. Int. J. Comput. Appl. 129(2), 25–30 (2015)

    Article  Google Scholar 

  3. Singh, M.K., Tiwari, R.: A survey on scheduling of parallel program in heterogeneous system. Int. J. Advanced Research in Computer Engineering & Technology. 1(8), 357 (2012)

    Google Scholar 

  4. He, Y., Liu, J., Sun, H.: Scheduling functionally heterogeneous systems with utilization balancing. In: IEEE International Parallel and Distributed Processing Symposium, pp. 1187–1198 (2011)

    Google Scholar 

  5. Alam, M., Varshney, A.K.: A comparative study of interconnection network. Int. J. Comput. Appl. 127(4), 37–43 (2015)

    Article  Google Scholar 

  6. Choudhury, P.: Online scheduling of dynamic task graphs with communication and contention for multiprocessors. IEEE Trans. Parallel Distrib. Syst. 23(1), 126–133 (2012)

    Article  Google Scholar 

  7. Amalarethinam, D.I.G., Joyce Mary, G.J.: A new DAG based dynamic task scheduling algorithm (DYTAS) for multiprocessor systems. Int. J. Comput. Appl. 19(8), 24–28 (2011)

    Google Scholar 

  8. Kaur, P., Kaur, A.: Implementation of Dynamic Level Scheduling Algorithm Using Genetic Operators. Int. J. of Appl. or Innovation in Eng. & Manag. 2(7), 2319–4847 (2013)

    Google Scholar 

  9. Khan, Z.A., Siddiqui, J., Samad, A.: Linear crossed cube (LCQ): a new interconnection network topology for massively parallel system. Int. J. Comput. Netw. Inf. Secur. 7(3), 18–25 (2015)

    Google Scholar 

  10. Kurt, M.C., Krishnamoorthy, S., Agrawal, K., Agrawal, G.: Fault-tolerant dynamic task graph scheduling. In: SC14: International Conference for High Performance Computing, Networking, Storage and Analysis (2014)

    Google Scholar 

  11. Visalakshi, P., Sivanandam, S.N.: Dynamic Task Scheduling with Load Balancing using Hybrid Practical Swarm Optimization. Int. J. Open Problems Compt. Math. 2(3), 475–488 (2009)

    Google Scholar 

  12. Khan, Z.A., Siddiqui, J., Samad, A.: A novel multiprocessor architecture for massively parallel system. Int. Conf. Parallel Distrib. Grid Comput. 466–471 (2015)

    Google Scholar 

  13. Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. (CSUR) 31(4) (1999)

    Article  Google Scholar 

  14. Evans, D.J., Butt, W.U.N.: Dynamic load balancing using task-transfer probabilities. Parallel Comput. Elsevier North-Holland 19, 897–916 (1993)

    Article  Google Scholar 

  15. Zomaya, A.Y., Hwei, Y.: Observations on using genetic algorithms for dynamic load-balancing. Parallel Distrib. Syst. IEEE 12(9) (2001)

    Article  Google Scholar 

  16. Munetomo, M., Takai, Y., Sato, Y.: A genetic approach to dynamic load-balancing in a distributed computing system. In: Proceedings of First International Conference on Evolutionary Computation, IEEE World Congress Computational Intelligence, vol. 1, pp. 418–421 (1994)

    Google Scholar 

  17. Pico, C.A.G., Wainwright, R.L.: Dynamic scheduling of computer tasks using genetic algorithms. In: Proceedings of First IEEE Conference Evolutionary Computation, IEEE World Congress Computational Intelligence, vol. 2, pp. 829–833 (1994)

    Google Scholar 

  18. Kelly, O.R., Aydin, H.: Fixed—priority global scheduling for mixed-critically real-time system. Int. J. Embedded Syst. 6(2/3) (2014)

    Google Scholar 

  19. Sun, Y., Lipariy, G., Guanzx, N., Yix, W.: Improving the Response Time Analysis of Global Fixed-Priority Multiprocessor Scheduling. Embedded and Real-Time IEEE Xplore (2014)

    Google Scholar 

  20. Davis, R.I., Burns, A.: Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Syst. 47(1), 1–40 (2011)

    Article  Google Scholar 

  21. Guan, N., Stigge, M., Yi, W., Yu, G.: New response time bounds for fixed priority multiprocessor scheduling. In: 30th IEEE on Real-Time Systems Symposium, 2009, RTSS 2009, pp. 387–397. IEEE (2009)

    Google Scholar 

  22. Guan, N., Stigge, M., Yi, W., Yu, G.: New Response Time Bounds for Fixed Priority Multiprocessor Scheduling. In Real-Time Systems Symposium, RTSS 2009. 387–397 IEEE, (2009)

    Google Scholar 

  23. Li, H., Baruah, S.: Load-based schedulability analysis of certifiable mixed-criticality systems. In: Proceedings of the 10th ACM International Conference on Embedded Software (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mahfooz Alam .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alam, M., Khan, A., Varshney, A.K. (2018). A Review of Dynamic Scheduling Algorithms for Homogeneous and Heterogeneous Systems. In: Muttoo, S. (eds) System and Architecture. Advances in Intelligent Systems and Computing, vol 732. Springer, Singapore. https://doi.org/10.1007/978-981-10-8533-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8533-8_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8532-1

  • Online ISBN: 978-981-10-8533-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics