Dynamic Tasks Scheduling Model for Performance Evaluation of a Distributed Computing System through Artificial Neural Network | SpringerLink
Skip to main content

Dynamic Tasks Scheduling Model for Performance Evaluation of a Distributed Computing System through Artificial Neural Network

  • Conference paper
  • First Online:
Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 130))

Abstract

As technology has quickly and relentlessly advanced in the field of computer hardware, Distributed Computing System [DCS] has become increasingly popular. Performance enhancement is one of the most important issues in distributed systems. In this paper we have proposed a dynamic task allocation model based on artificial neural network [ANN] scheduling approach to arrange the tasks to the processors. Relocating the tasks from one processor to another at certain points during the course of execution of the program that contributes to the total cost of the running program has been taken into account. Phase-wise Execution Cost [EC], Inter Task Communication Cost [ITCC], Residence Cost [RC] of each task on different processors and Relocation Cost [REC] for each task has been considered while preparing the model.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bokhari, S.H.: A Shortest Tree Algorithm for Optimal Assignments across Space and Time in a Distributed Processor Systems. IEEE Trans. Software Eng. SE-7(6), 583–589 (1981)

    Article  Google Scholar 

  2. Bokhari, S.H.: Assignment Problem in Parallel and Distributed Computing. Kulwer Academic Publishers (1987)

    Google Scholar 

  3. Stone, H.S.: Multiprocessor Scheduling with the Aid of Network Flow Algorithms. IEEE Trans. Software SE-3(l), 85–93 (1977)

    Article  Google Scholar 

  4. Towsley, D.F.: Allocating Programs Containing Branches and Loops within a Multiple Processor System. IEEE Trans. Software Eng. SE-12(10), 1018–1024 (1986)

    Google Scholar 

  5. Baca, D.F.: Allocating Modules to Processors in a Distributed System. IEEE Trans. Software Eng. SE-15(11), 1427–1436 (1989)

    Article  Google Scholar 

  6. Ghafoor, Yang, J.: A Distributed Heterogeneous Supercomputing Management System. IEEE Comput. 6, 78–86 (1993)

    Article  Google Scholar 

  7. Singh, M.P., Yadav, P.K., Kumar, H.: A Tasks Allocation Model for Efficient Utilization Of Processor’s Capacity in Heterogeneous Distributed Systems. Presented 9th Conference of International Academy of Physical Sciences, Held at Agra University Agra February 03-05 (2007)

    Google Scholar 

  8. Cho, S.Y., Park, K.H.: Dynamic Task Assignment in Heterogeneous Linear Array Networks for Metacomputing. In: Proceeding of IPPS, pp. 66–71 (1994)

    Google Scholar 

  9. Lee, C.H., Lee, D., Kim, M.: Optimal Task Assignment in Linear Array Networks. IEEE Trans. Comput. C-41(7), 877–880 (1992)

    Article  MathSciNet  Google Scholar 

  10. Bokhari, S.H.: Dual Processor Scheduling with Dynamic Re-Assignment. IEEE Trans. On Software Engineering SE-5, 341–349 (1979)

    Article  MathSciNet  Google Scholar 

  11. Kumar, V., Singh, M.P., Yadav, P.K.: An Efficient Algorithm for Multiprocessor Scheduling with Dynamic Re-assignment. In: Proceeding of 6th National Seminar on Theoretical Computer Science, pp. 105–118 (1996)

    Google Scholar 

  12. Yadav, P.K., Singh, M.P., Kumar, H.: Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Re-assignment. Journal of Computer Systems, Networks, and Communications (1), Article ID 578180, 1–9 (2008), doi:10.1155/2008

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. P. Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer India Pvt. Ltd.

About this paper

Cite this paper

Singh, M.P., Yadav, P.K., Kumar, H., Agarwal, B. (2012). Dynamic Tasks Scheduling Model for Performance Evaluation of a Distributed Computing System through Artificial Neural Network. In: Deep, K., Nagar, A., Pant, M., Bansal, J. (eds) Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011. Advances in Intelligent and Soft Computing, vol 130. Springer, India. https://doi.org/10.1007/978-81-322-0487-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-0487-9_31

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-0486-2

  • Online ISBN: 978-81-322-0487-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics