Skip to main content

Scheduling Optimization in Grid with VO Stakeholders’ Preferences

  • Conference paper
  • First Online:

Part of the book series: Studies in Computational Intelligence ((SCI,volume 678))

Abstract

The problem of intelligent Grid computing and job-flow scheduling with regard to preferences given by various groups of virtual organization (VO) stakeholders (such as users, resource owners and administrators) is studied. A specific flexible resources share algorithm is proposed for job-flow scheduling which enables to achive a balance between the VO stakeholders’ conflicting preferences and policies. This approach provides greater VO scheduling fairness, improves the overall quality of service and resource load efficiency. Two different metrics are introduced to find a scheduling solution balanced between VO stakeholders. Experimental results prove that the cyclic scheduling scheme allows establishing efficient cooperation between different VO stakeholders even if their goals and preferences are contradictory.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blanco, H., Guirado, F., Lrida, J.L., Albornoz, V.M.: MIP model scheduling for multiclusters. In Euro-Par 2012, pages 196-206, Heidelberg, 2012. Springer.

    Google Scholar 

  2. Buyya, R., Abramson, D., Giddy., J.: Economic models for resource management and scheduling in Grid computing. J. Concurrency and Computation, 14(5):1507-1542, 2002.

    Google Scholar 

  3. Carroll, T., Grosu, D.: Divisible load scheduling: An approach using coalitional games. In Proceedings of the Sixth International Symposium on Parallel and Distributed Computing, ISPDC 07, page 36, 2007.

    Google Scholar 

  4. Dalheimer, M., Pfreundt, F., Merz, P.: Agent-based Grid scheduling with Calana. In Parallel Processing and Applied Mathematics, 6th International Conference, pages 741-750. Springer, 2006.

    Google Scholar 

  5. Ernemann, C., Hamscher, V., Yahyapour, R.: Economic scheduling in Grid computing. In D. Feitelson, L. Rudolph, and U. Schwiegelshohn, editors, JSSPP, volume 18, pages 128-152. Springer, Heidelberg, 2002.

    Google Scholar 

  6. Farahabady, M.H., Lee, Y.C., Zomaya, A.Y.: Pareto-optimal cloud bursting. In IEEE Transactions on Parallel and Distributed Systems, volume 25, pages 2670-2682, 2014.

    Google Scholar 

  7. Garg, S., Yeo, C., Anandasivam, C., Buyya, R.: Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers. J. Parallel and Distributed Computing, 71(6):732-749, 2011.

    Google Scholar 

  8. Garg, S.K., Konugurthi, P., Buyya., R.: A linear programming-driven genetic algorithm for meta-scheduling on utility Grids. J. Par., Emergent and Distr. Systems, (26):493-517, 2011.

    Google Scholar 

  9. Gulati, A., Ahmad, I., Waldspurger, C.: PARDA: Proportional allocation of resources for distributed storage access. In FAST ‘09 Proccedings of the 7th conference on File and storage technologies, pages 85-98, California, USA, 2009.

    Google Scholar 

  10. Inoie, A., Kameda, H., Touati, C.: Pareto set, fairness, and Nash equilibrium: A case study on load balancing. In Proceedings of the 11th International Symposium on Dynamic Games and Applications, pages 386-393, Arizona, USA, 2004.

    Google Scholar 

  11. Kim, K., Buyya, K.: Fair resource sharing in hierarchical virtual organizations for global Grids. In Proceedings of the 8th IEEE/ACM International Conference on Grid Computing, pages 50-57, Austin, USA, 2007. IEEE Computer Society.

    Google Scholar 

  12. Kurowski, K., Nabrzyski, K., Oleksiak, A., Weglarz, J.: Multicriteria aspects of Grid resource management. In J. Nabrzyski, Schopf J.M., and J. Weglarz, editors, Grid resource management. State of the Art and Future Trends, pages 271-293. Kluwer Acad. Publ., 2003.

    Google Scholar 

  13. Mutz, A., Wolski, R., Brevik, J.: Eliciting honest value information in a batch-queue environment. In 8th IEEE/ACM International Conference on Grid Computing, pages 291-297, New York, USA, 2007. ACM.

    Google Scholar 

  14. Rzadca, K., Trystram, D., Wierzbicki, A.: Fair game-theoretic resource management in dedicated Grids. In IEEE International Symposium on Cluster Computing and the Grid (CCGRID 2007), pages 343-350, Rio De Janeiro, Brazil, 2007. IEEE Computer Society.

    Google Scholar 

  15. Skowron, P., Rzadca, K.: Non-monetary fair scheduling cooperative game theory approach. In Proceeding of SPAA ‘13 Proceedings of the twenty-_fth annual ACM symposium on Parallelism in algorithms and architectures, pages 288-297, New York, USA, 2013. ACM.

    Google Scholar 

  16. Takefusa, A., Nakada, H., Kudoh, T., Tanaka, Y.: An advance reservation-based co-allocation algorithm for distributed computers and network bandwidth on QoS-guaranteed Grids. In Schwiegelshohn U. Frachtenberg E., editor, JSSPP 2010, volume 6253, pages 16-34. Springer, Heidelberg, 2010.

    Google Scholar 

  17. Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Slot selection algorithms in distributed computing. Journal of Supercomputing, 69(1):53-60, 2014.

    Google Scholar 

  18. Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D., Potekhin, P.: Core heuristics for preference-based scheduling in virtual organizations of utility grids. In Studies in Computational Intelligence, volume 570, pages 321-330. Springer International Publishing, 2015.

    Google Scholar 

  19. Toporkov, V., Toporkova, A., Tselishchev, A., Yemelyanov, D., Potekhin, P.:Metascheduling and heuristic co-allocation strategies in distributed computing. Computing and Informatics, 34(1):45-76, 2015.

    Google Scholar 

  20. Toporkov, V., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Composite scheduling strategies in distributed computing with non-dedicated resources. Procedia Computer Science, 9:176-185, 2012.

    Google Scholar 

  21. Toporkov, V., Tselishchev, A., Yemelyanov, D., Potekhin, P.: Metascheduling strategies in distributed computing with non-dedicated resources. In W. Zamojski and J. Sugier, editors, Dependability Problems of Complex Information Systems, Advances in Intelligent Systems and Computing, volume 307, pages 129-148. Springer, 2015.

    Google Scholar 

  22. Vasile, M., Pop, F., Tutueanu, R., Cristea, V., Kolodziej,J.: Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing. Future Generation Computer Systems, 51:61-71, 2015.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dmitry Yemelyanov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Toporkov, V., Toporkova, A., Yemelyanov, D., Bobchenkov, A., Tselishchev, A. (2017). Scheduling Optimization in Grid with VO Stakeholders’ Preferences. In: Badica, C., et al. Intelligent Distributed Computing X. IDC 2016. Studies in Computational Intelligence, vol 678. Springer, Cham. https://doi.org/10.1007/978-3-319-48829-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48829-5_18

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics