A Survey for Different Classifications of Distributed Systems Scheduling Using Markov Chain Model

Authors

  • Shweta Jain  Research Scholar, Faculty of Computer Science, Pacific Academy of Higher Education and Research University, Udaipur,Rajasthan, India
  • Saurabh Jain  Professor, Shri Vaishnav Institute of Computer Applications, Shri Vaishnav Vidyapeeth Vishwavidyalaya, Indore, Madhya Pradesh, India

Keywords:

Coscheduling, Distributed system, Markov Chain, Scheduling, Stochastic, Transition Matrix.

Abstract

With the establishment of internet with network technologies and the maturity in the computing industry, the distributed system has become popular and important with aspects of a challenging activity. The performance of computing system has enhanced extensively with the adding up of the concepts of multiprocessing and multi-computing. In distributed system, computing and developing of scheduling algorithm for vast spectrum of applications are a key problem and of greater interest of studying and scheduling for resource management. This paper presents a survey to classify various existing distributed system scheduling to apply the concept of Markov chain model to improve their throughput and performance.

References

  1. C. Arpaci-Dusseau, “Implicit Coscheduling: Coordinated Scheduling with Implicit Information in Distributed Systems,” ACM Trans. on Computer Systems, Vol.19, No. 3, pp.283-331, Aug. 2001.
  2. P. Barcaccia, M.A. Bonuccelli, and M. Di Ianni, “Complexity of Minimum Length Scheduling for Precedence Constrained messages in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, Vol.11, No.10, pp. 1090-1102, Oct. 2000.
  3. Lampson, M. Abadi, M. Burrows, and E. Wobber, “Authentication in distributed systems: Theory and practice,” ACM Trans. Computer Systems, Vol.10, No.4, pp 265-310, Nov. 1992.
  4. V. M. Lo, “Heuristic Algorithms for Task Assignment in Distributed Systems,” IEEE Trans. Computers, Vol. 37, No.11, pp. 1384-1397, 1988.
  5. F. Petrini and W.C. Feng, “Scheduling with Global Information in Distributed Systems,” Proc. 20th Int’l Conf. Distributed Computing Systems, pp. 225 - 232, April 2000.
  6. S. Srinivasn and N. K. Jha, “Safty and Reliability Driven Task Allocation in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, Vol.10, No.3, pp. 238-251, Mar. 1999.
  7. H. Topcuoglu, S. Hariri, and M.-Y. Wu, “Performance-effective and Low-complexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel and Distributed Sys., Vol.13, No.3, Mar. 2002.
  8. International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-3, July 2012, Overview of Scheduling Tasks in Distributed Computing Systems, O. M. Elzeki, M. Z. Rashad, M. A. Elsoud
  9. Ramya S Gowda, “Qualitative Study on the efficiency of Load balancing algorithms in Cloud Environment,” IOSR Journal of Computer Engineering (IOSR-JCE), Vol. 16, No. 6, Ver. VIII, pp 09-12, Nov - Dec. 2014.
  10. Thomas l. Casavant and jon g. Kuhl, “A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems, IEEE Transactions On Software Engineering, Vol. 14, No. 2, pp 141-154,February 1988.
  11. Medhi, J. Stochastic processes, Ed. 4, Wiley Limited (Fourth Reprint), New Delhi. 1991.
  12. Silberschatz, A., Galvin, P. and Gagne, G. Operating System Concepts, International Student Version, Ed.8, India, John Wiley and Sons, Inc. 2010.
  13. A. S. Tanenbaum and M. V. Steen, Distributed Systems: Principles and Paradigms, Low price edition, Pearson Prentice Hall.
  14. Chapin, Steven J. and Weissman, Jon B, "Distributed and Multiprocessor Scheduling" (2002). Electrical Engineering and Computer Science. Paper 40.
  15. X. Evers, Thesis on “A literature study on scheduling in Distributed system”, submitted on Department of Mathematics and computing operating system and distributed systems group Delft University of Technology, The Netherlands, Oct.1992
  16. Dongning Liang, Pei-Jung Ho, Bao Liu, “Scheduling in Distributed Systems”.
  17. Waldspurger, C.A., Weihl, W.E. (1994). Lottery Scheduling: Flexible Proportional-Share Resource Management. First USENIX Symposium on Operating System Design and Implementation.
  18. Waldspurger, C.A., Weihl, W.E. (1995). Stride Scheduling: Deterministic Proportional-Share Resource Management. Technical Report MIT/LCS/TM-528, Massachusetts Institute of Technology, MIT Laboratory for Computer Science.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

0000-00-00

Issue

Volume 2, Issue 5, September-October-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Shweta Jain, Saurabh Jain, " A Survey for Different Classifications of Distributed Systems Scheduling Using Markov Chain Model" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 5, pp.374-379, September-October-2017.