Skip to main content

Resource Co-allocation Algorithms for Job Batch Scheduling in Dependable Distributed Computing

  • Conference paper
Dependable Computer Systems

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

Abstract

This work presents slot selection algorithms in economic models for independent job batch scheduling in distributed computing with non-dedicated resources. Existing approaches towards resource co-allocation and multiprocessor job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. The sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. This work discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed and compared. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

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. Garg, S.K., Buyya, R., Siegel, H.J.: Scheduling parallel applications on utility Grids: time and cost trade-off management. In: Proc. of ACSC 2009, pp. 151–159. Wellington, New Zealand (2009)

    Google Scholar 

  2. Ailamaki, A., Dash, D., Kantere, V.: Economic aspects of cloud computing. Flash Informatique, Special HPC, 45–47 (October 27, 2009)

    Google Scholar 

  3. Bredin, J., Kotz, D., Rus, D.: Economic markets as a means of open mobile-agent systems. In: Proc. of MAC 3, Seattle, USA, pp. 43–49 (1999)

    Google Scholar 

  4. Kurowski, K., Nabrzyski, J., Oleksiak, A., et al.: Multicriteria aspects of Grid resource management. In: Nabrzyski, J., Schopf, J.M., Weglarz, J. (eds.) Grid Resource Management. State of the art and future trends. Kluwer Academic Publishers, Boston (2003)

    Google Scholar 

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

    Chapter  Google Scholar 

  6. Toporkov, V.V.: Job and application-level scheduling in distributed computing. Ubiquitous Comput. Commun. J. 4, 559–570 (2009)

    Google Scholar 

  7. Buyya, R., Abramson, D., Giddy, J.: Economic models for resource management and scheduling in grid computing. J. of Concurrency and Computation: Practice and Experience 5(14), 1507–1542 (2002)

    Article  Google Scholar 

  8. Ernemann, C., Hamscher, V., Yahyapour, R.: Economic scheduling in grid computing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 128–152. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Toporkov, V.V.: Decomposition schemes for synthesis of scheduling strategies in scalable systems. J. Comput. Syst. Sci. Int. 45, 77–88 (2006)

    Article  MathSciNet  Google Scholar 

  10. Toporkov, V.V., Tselishchev, A.S.: Safety scheduling strategies in distributed computing. Int. J. Critical Computer-Based Syst. 1-3, 41–58 (2010)

    Article  Google Scholar 

  11. Toporkova, V.V., Toporkova, A., Tselishchev, A., Yemelyanov, D., Bobchenkov, A.: Economic models of scheduling in distributed systems. In: Walkowiak, T., Mazurkiewicz, J., Sugier, J., Zamojski, W. (eds.) Monographs of System Dependability. Dependability of Networks, Oficyna Wydawnicza Politechnki Wroclawskiej, Wroclaw (2010)

    Google Scholar 

  12. Mu’alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. on Parallel and Distributed Systems 6(12), 529–543 (2001)

    Article  Google Scholar 

  13. Taha, H.: Operations research: an introduction. Macmillan, New York (1982)

    Google Scholar 

  14. Toporkova, V.V., Toporkova, A., Tselishchev, A., Yemelyanov, D.: Scalable co-scheduling strategies in distributed computing. In: Proc. of the 2010 ACS/IEEE Int. Conf. on Computer Systems and Applications. IEEE CS Press, Los Alamitos (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Toporkov, V., Yemelyanov, D., Toporkova, A., Bobchenkov, A. (2011). Resource Co-allocation Algorithms for Job Batch Scheduling in Dependable Distributed Computing. In: Zamojski, W., Kacprzyk, J., Mazurkiewicz, J., Sugier, J., Walkowiak, T. (eds) Dependable Computer Systems. Advances in Intelligent and Soft Computing, vol 97. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21393-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21393-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21392-2

  • Online ISBN: 978-3-642-21393-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics