Skip to main content
SpringerLink
Log in

Packet task processing in distributed computational environments with inalienable resources

  • Stochastic Systems, Queueing Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We study the planning problems for a packet of independent tasks in a virtual user organization of a distributed computational environment with inalienable resources. The plan is constructed based on a dynamically updated list of slots, each of which corresponds to a time interval during which a certain kind of resource is available. The planning is done cyclically, and the set of available slots is known at the beginning of every planning cycle. We propose a scheme to find the necessary number of slots suitable for completing the task. We consider the solutions of search problems for an optimal, in the single-criterion setting, and efficient, for a given vector of criteria, slot combinations with dynamic programming.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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. 32nd Austral. Comput. Sci. Conf. (ACSC 2009), Wellington, New Zealand, 2009, pp. 151–159.

    Google Scholar 

  2. Tesauro, G. and Bredin, J.L., Strategic Sequential Bidding in Auctions using Dynamic Programming, AAMAS’02 Proc. First Int. Joint Conf. Autonom. Agents Multiagent Syst., New York: ACMNew York, 2002, part 2, pp. 591–598.

    Chapter  Google Scholar 

  3. Garg, S.K., Yeo, C.S., Anandasivam, A., and Buyya, R., Environment-conscious Scheduling of HPC Applications on Distributed Cloud-oriented Data Centers, J. Parallel Distribut. Comput., 2011, vol. 71, no. 6, pp. 732–749.

    Article  MATH  Google Scholar 

  4. Buyya, R., Abramson, D., and Giddy, J., Economic Models for Resource Management and Scheduling in Grid Computing, J. Concurrenc. Comput.: Practic. Experienc., 2002, vol. 14, no. 5, pp. 1507–1542.

    Article  MATH  Google Scholar 

  5. Ernemann, C., Hamscher, V., and Yahyapour, R., Economic Scheduling in Grid Computing, Proc. 8th Job Scheduling Strateg. Parallel Proc., Feitelson, D.G., Rudolph, L., and Schwiegelshohn, U., Eds., Heidelberg: Springer-Verlag, LNCS, 2002, vol. 2537, pp. 128–152.

    Chapter  Google Scholar 

  6. Kovalenko, V.N., Kovalenko, E.I., Koryagin, D.A., et al., Controlling Parallel Tasks in a Grid with Inalienable Resources, Preprint of Inst. of Applied Mathematics, Ross. Acad. Sci., Moscow, 2007, no. 63.

  7. Kurowski, K., Nabrzyski, J., Oleksiak, A., et al., Multicriteria Aspects of Grid Resource Management, in Grid Resource Management. State of the Art and Future Trends, Nabrzyski, J., Schopf, J.M., and Weglarz, J., Eds, New York: Kluwer, 2003, pp. 271–293.

    Google Scholar 

  8. Toporkov, V., Application-Level and Job-Flow Scheduling: An Approach for Achieving Quality of Service in Distributed Computing, Proc. 10 Int. Conf. Parallel Comput. Technol., Heidelberg: Springer-Verlag, LNCS, 2009, vol. 5698, pp. 350–359.

    Google Scholar 

  9. Toporkov, V.V., Job and Application-Level Scheduling in Distributed Computing, Ubiquitous Comput. Commun. J., 2009, vol. 4, no. 3, pp. 559–570.

    Google Scholar 

  10. Toporkov, V.V., Modeli raspredelennykh vychislenii (Models of Distributed Computations), Moscow: Fizmatlit, 2004.

    Google Scholar 

  11. Toporkov, V.V., Decompositional Synthesis Schemes for Planning Strategies in Scalable Systems, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2006, no. 1, pp. 82–93.

  12. Toporkov, V.V. and Tselishchev, A.S., Safety Scheduling Strategies in Distributed Computing, Int. J. Critical Comput.-Based Syst., 2010, vol. 1, no. 1/2/3, pp. 41–58.

    Article  Google Scholar 

  13. Voevodin, V.V., The Solution of Large Problems in Distributed Computational Media, Autom. Remote Control, 2007, vol. 68, no. 5, pp. 773–786.

    Article  MathSciNet  MATH  Google Scholar 

  14. Toporkov, V.V., Flow and Greedy Algorithms for Resource Co-Allocation in Distributed Systems, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2007, no. 2, pp. 109–119.

  15. Taha, H.A., Operations Research: An Introduction, Prentice Hall, 2006, vol. 1. Translated under the title Vvedenie v issledovanie operatsii, Moscow: Mir, 1985.

  16. Toporkov, V., Toporkova, A., Bobchenkov, A., and Yemelyanov, D., Resource Selection Algorithms for Economic Scheduling in Distributed Systems, Procedia Comput. Sci., 2011, vol. 4, pp. 2267–2276.

    Article  Google Scholar 

  17. Toporkov, V., Yemelyanov, D., Toporkova, A., and Bobchenkov, A., Resource Co-Allocation Algorithms for Job Batch Scheduling in Dependable Distributed Computing, Dependable Comput. Syst., Heidelberg: Springer-Verlag, AICS, 2011, vol. 97, pp. 243–256.

    Chapter  Google Scholar 

  18. Toporkov, V., Bobchenkov, A., Toporkova, A., et al., Slot Selection and Co-Allocation for Economic Scheduling in Distributed Computing, Proc. 11 Int. Conf. Parallel Comput. Technolog., Heidelberg: Springer-Verlag, LNCS, 2011, vol. 6873, pp. 368–383.

    Google Scholar 

  19. Toporkov, V., Multilevel Strategies of Resource Co-Allocation in Distributed Computations with Control Periods, Autom. Remote Control, 2007, vol. 68, no. 12, pp. 2214–2227.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University “MEI,”, Moscow, Russia

    V. V. Toporkov

Authors
  1. V. V. Toporkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © V.V. Toporkov, 2012, published in Avtomatika i Telemekhanika, 2012, No. 10, pp. 52–70.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toporkov, V.V. Packet task processing in distributed computational environments with inalienable resources. Autom Remote Control 73, 1632–1647 (2012). https://doi.org/10.1134/S0005117912100050

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation