Skip to main content
Log in

Economic model of scheduling and fair resource sharing in distributed computations

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

A model for job flow scheduling and fair resource sharing in distributed computing environments is proposed. The model helps one to take into account requirements in the virtual organization imposed by the users on efficiency and job performance quality. With the proposed slot selection algorithms, one can find alternatives optimal with respect to a given criterion for each job in the batch.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Garg, S.K., Buyya, R., and Siegel, H.J., Scheduling parallel applications on utility Grids: time and cost trade-off management, Proc. of ACSC 2009, Wellington, New Zealand, 2009, pp. 151–159.

    Google Scholar 

  2. Buyya, R., Abramson, D., and Giddy, J., Economic models for resource management and scheduling in grid computing, J. Concurrency Computation: Practice Experience, 2002, vol. 14, no. 5, pp. 1507–1542.

    Article  MATH  Google Scholar 

  3. Kurowski, K., Nabrzyski, J., Oleksiak, A., and Weglarz, J., Multicriteria aspects of Grid resource management, Grid resource management. State of the art and future trends, Nabrzyski, J., Schopf, J.M., and Weglarz. J., Eds., Kluwer, 2003, pp. 271–293.

    Google Scholar 

  4. Foster, I., Kesselman, C., Nick, J., and Tuecke, S., The physiology of the Grid: an open Grid services architecture for distributed systems integration. http://www.globus.org/research/papers/ogsa.pdf

  5. Toporkov, V.V., Application-level and job-flow scheduling: an approach for achieving quality of service in distributed computing, Proc. of PaCT-2009, Springer, Heidelberg. LNCS, 2009, vol. 5698, pp. 350–359.

  6. Toporkov, V.V., Job and application-level scheduling in distributed computing, Ubiquitous Computing Communication J. Applied Computing, 2009, vol. 4, no. 3, pp. 559–570.

    MathSciNet  Google Scholar 

  7. Voevodin, V.V., Zholudev, Yu.A., Sobolev, S.I., and Stephanov, K.S., Evolution of the X-Com metacomputing system, Vestnik Nizhegorodskogo universiteta im. N.I. Lobachevskogo (Proc. of Lobachevsky State University of Nizhni Novgorod), 2009, no. 4. pp. 157–164.

    Google Scholar 

  8. Kovalenko, V.N., Kovalenko, E.I., Koryagin, D.A., et. al., Parallel job management in the Grid with nondedicated resources, Preprint of Keldysh Inst. of Appl. Math., Russ. Acad. Sci., Moscow, no. 63, 2007.

    Google Scholar 

  9. Kiselev, A., Korneev, V., Semenov, D., and Sakharov, I., Metacomputing system management, Otkrytye sistemy, 2005, no. 2, pp. 11–16.

    Google Scholar 

  10. Toporkov, V.V., Flow and greedy algorithms of resource co-allocation in distributed systems, Comput. Syst. Sci. Int., 2007, vol. 46, no. 2, pp. 269–278.

    Article  MATH  MathSciNet  Google Scholar 

  11. Berezovskii, P.S., Implementation of the SARD job scheduling system in one-level Grid, Preprint of Keldysh Inst. of Appl. Math., Russ. Acad. Sci., Moscow, no. 49, 2010.

    Google Scholar 

  12. Berezovskii, P.S. and Kovalenko, V.N., Scheduling in the Grid with shared resources based on statistical data, Programmnye produkty i sistemy, 2009, vol. 85, no. 1, pp. 3–6.

    Google Scholar 

  13. Konovalov, M.G., Malashenko, Yu.E., and Nazarova I.A., Job control in heterogeneous computing systems, Comput. Syst. Sci. Int., 2011, vol. 50, no. 2, pp. 220–237.

    Article  MATH  MathSciNet  Google Scholar 

  14. Konovalov, M.G., Dushin, Yu.A., Malashenko, Yu.E., and Shorgin, S.Ya., The model of interaction among consumers and remote computational resources by means of brokers, Systemy i sredstva informatiki, 2009, vol. 19, no 1, pp. 5–33.

    Google Scholar 

  15. Toporkov, V., Bobchenkov, A., Toporkova, A., Tselishchev, A., and Yemelyanov, D. Slot selection and coallocation for economic scheduling in distributed computing, Proc. of the 11th Int. Conf. on Parallel Computing Technologies, Berlin: Springer, LNCS, 2011, vol. 6873, pp. 368–383.

  16. Toporkov, V., Tselishchev, A., Yemelyanov, D., and Bobchenkov, A., Composite scheduling strategies in distributed computing with non-dedicated resources, Procedia Computer Science, 2012, vol. 5, pp. 200–209.

    Google Scholar 

  17. Jackson, D, Snell, Q., and Clement, M., Core algorithms of the Maui scheduler, JSSPP, LNCS 2221, Berlin: Springer, 2001, pp. 87–102.

    Google Scholar 

  18. Ernemann, C., Hamscher, V., and Yahyapour, R., Economic scheduling in Grid computing, Proc. of the 8th Int. JSSPP Workshop, LNCS, vol. 2537, 2002, pp. 129–152.

    Google Scholar 

  19. Bobchenkov, A.V., Toporkov, V.V., and Tselishchev, A.S., Certificate no. 2011613239 for the state registration of Distributed Computer Environment Simulation Modeling System software, Moscow Power Engineering Institute (Technical University) (RU).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. V. Toporkov.

Additional information

Original Russian Text © V.V. Toporkov, D.M. Yemelyanov, 2014, published in Programmirovanie, 2014, Vol. 40, No. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toporkov, V.V., Yemelyanov, D.M. Economic model of scheduling and fair resource sharing in distributed computations. Program Comput Soft 40, 35–42 (2014). https://doi.org/10.1134/S0361768814010071

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768814010071

Keywords

Navigation