Skip to main content

A Decentralized Multi-agent Approach to Job Scheduling in Cloud Environment

  • Conference paper
Intelligent Systems'2014

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

Abstract

Paper proposes a novel solution to a job scheduling problem in the Cloud Computing systems. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and completion time. It employs the Pareto dominance concept implemented at the client level. To select the best scheduling strategies from the Pareto frontier and construct a global scheduling solution we develop decision-making mechanisms based on the game-theoretic model of Spatial Prisoner’s Dilemma and realized by selfish agents operating in the two-dimensional Cellular Automata space. Their behavior is conditioned by objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The related results show the effectiveness and scalability of this scheme in the presence of a large number of jobs and resources involved in the scheduling process.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Christodoulou, G., Koutsoupias, E., Vidali, A.: A Lower Bound for Scheduling Mechanisms. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1163–1170. Society for Industrial and Applied Mathematics, Philadelphia (2007)

    Google Scholar 

  2. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multiobjective Optimisation: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Dogan, A., Özgüner, F.: On QoS-Based Scheduling of a Meta-Task with Multiple QoS Demands in Heterogeneous Computing. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, p. 227. IEEE Computer Society, Washington, DC (2002)

    Google Scholar 

  4. Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibrium in Load Balancing. ACM Trans. Algorithms 3(3) (August 2007)

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  6. Kolodziej, J., Xhafa, F.: Meeting Security and User Behavior Requirements in Grid Scheduling. Simulation Modelling Practice and Theory 19(1), 213–226 (2011)

    Article  Google Scholar 

  7. Li, Z.-J., Cheng, C.-T., Huang, F.-X.: Utility-Driven Solution for Optimal Resource Allocation in Computational Grid. Comput. Lang. Syst. Struct. 35(4), 406–421 (2009)

    Google Scholar 

  8. Londoño, J., Bestavros, A., Teng, S.-H.: Colocation Games And Their Application to Distributed Resource Management. In: Proceedings of the 2009 Conference on Hot Topics in Cloud Computing, HotCloud 2009. USENIX Association, Berkeley (2009)

    Google Scholar 

  9. Nowak, M.A., May, R.M.: Evolutionary Games and Spatial Chaos. Nature 359, 826 (1992)

    Article  Google Scholar 

  10. Palmieri, F., Buonanno, L., Venticinque, S., Aversa, R., Di Martino, B.: A Distributed Scheduling Framework Based on Selfish Autonomous Agents for Federated Cloud Environments. Future Gener. Comput. Syst. 29(6), 1461–1472 (2013)

    Article  Google Scholar 

  11. Song, S., Hwang, K., Kwok, Y.-K.: Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling. IEEE Trans. Comput. 55(6), 703–719 (2006)

    Article  Google Scholar 

  12. Tchernykh, A., Schwiegelshohn, U., Yahyapour, R., Kuzjurin, N.: Online Hierarchical Job Scheduling on Grids with Admissible Allocation. J. of Scheduling 13(5), 545–552 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  13. Wu, C.-C., Sun, R.-Y.: An Integrated Security-Aware Job Scheduling Strategy For Large-Scale Computational Grids. Future Gener. Comput. Syst. 26(2), 198–206 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gąsior, J., Seredyński, F. (2015). A Decentralized Multi-agent Approach to Job Scheduling in Cloud Environment. In: Angelov, P., et al. Intelligent Systems'2014. Advances in Intelligent Systems and Computing, vol 322. Springer, Cham. https://doi.org/10.1007/978-3-319-11313-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11313-5_36

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11312-8

  • Online ISBN: 978-3-319-11313-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics