Skip to main content
SpringerLink
Log in

Slot selection algorithms in distributed computing

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources. A single slot is a time span that can be assigned to a task, which is a part of a job. The job launch requires a co-allocation of a specified number of slots starting synchronously. The challenge is that slots associated with different resources of distributed computational environments may have arbitrary start and finish points that do not match. Some existing algorithms assign a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. In this paper, algorithms for effective slot selection of linear complexity on an available slots number are studied and compared with known approaches. The novelty of the proposed approach consists of allocating alternative sets of slots. It provides possibilities to optimize job scheduling.

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. Lee YC, Wang C, Zomaya AY, Zhou BB (2012) Profit-driven Scheduling for Cloud Services with Data Access Awareness. J. Parallel and Distributed Computing 72(4):591–602

    Article  Google Scholar 

  2. Garg SK, Konugurthi P, Buyya R A Linear Programming-driven Genetic Algorithm for Meta-scheduling on Utility Grids. J. Parallel, Emergent and Distributed Systems 26, 493–517 (2011)

  3. Ernemann C, Hamscher V, Yahyapour R (2002) Economic Scheduling in Grid Computing. In: Feitelson DG, Rudolph L, Schwiegelshohn U (eds) JSSPP 2002, vol 2537, LNCSSpringer, Heidelberg, pp 128–152

  4. Kurowski K, Nabrzyski J, Oleksiak A, Weglarz J (2003) Multicriteria Aspects of Grid Re-source Management. In: Nabrzyski J, Schopf JM, Weglarz J (eds) Grid resource management. Kluwer Acad. Publishers, State of the art and future trends, pp 271–293

    Google Scholar 

  5. Toporkov V, Tselishchev A, Yemelyanov D, Bobchenkov A (2012) Composite Scheduling Strategies in Distributed Computing with Non-dedicated Resources. Procedia Computer Science. Elsevier 9:176–185

    Article  Google Scholar 

  6. Toporkov V, Tselishchev A, Yemelyanov D, Bobchenkov A (2012) Dependable Strategies for Job-flows Dispatching and Scheduling in Virtual Organizations of Distributed Computing Environments. Complex Systems and Dependability, vol 170, AISCSpringer, Heidelberg, pp 240–255

  7. Aida K, Casanova H (2008) Scheduling Mixed-parallel Applications with Advance Reservations. 17th IEEE Int., Symposium on HPDCIEEE CS Press, New York, pp 65–74

  8. Elmroth E, Tordsson J A Standards-based Grid Resource Brokering Service Supporting Advance Reservations, Coallocation and Cross-Grid Interoperability. J. Concurrency and Computation: Practice and Experience 25(18), pp 2298–2335 (2009)

  9. Takefusa A, Nakada H, Kudoh T, Tanaka Y (2010) An Advance Reservation-based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-guaranteed Grids. In: Frachtenberg E, Schwiegelshohn U (eds) JSSPP 2010, vol 6253, LNCSSpringer, Heidelberg, pp 16–34

  10. Blanco H, Guirado F, Lrida JL, Albornoz VM (2013) MIP Model Scheduling for Multi-clusters. Euro-Par 2012, vol 7640, LNCSSpringer, Heidelberg, pp 196–206

  11. Toporkov V, Toporkova A, Bobchenkov A, Yemelyanov D (2011) Resource Selection Algorithms for Economic Scheduling in Distributed Systems. Procedia Computer Science. Elsevier 4:2267–2276

    Article  Google Scholar 

  12. Toporkov V, Yemelyanov D, Toporkova A, Bobchenkov A (2011) Resource Co-allocation Algorithms for Job Batch Scheduling in Dependable Distributed Computing. Dependable Computer Systems, vol 97, AICSSpringer, Heidelberg, pp 243–256

  13. Toporkov V, Bobchenkov A, Toporkova A, Tselishchev A, Yemelyanov D (2011) Slot Selection and Co-allocation for Economic Scheduling in Distributed Computing. In: Malyshkin V (ed) PaCT 2011, vol 6873, LNCSSpringer, Heidelberg, pp 368–383

Download references

Acknowledgments

This work was partially supported by the Council on Grants of the President of the Russian Federation for State Support of Leading Scientific Schools (SS-362.2014.9), the Russian Foundation for Basic Research (Grant No. 12-07-00042), and by the Federal Target Program Research and scientific-pedagogical cadres of innovative Russia(state contract no. 16.740.11.0516).

Author information

Authors and Affiliations

  1. National Research University “MPEI”, ul. Krasnokazarmennaya, 14, Moscow, 111250, Russia

    Victor Toporkov & Dmitry Yemelyanov

  2. National Research University Higher School of Economics, Moscow State Institute of Electronics and Mathematics, Bolshoy Trekhsvyatitelsky per., 1-3/12, Moscow, 109028, Russia

    Anna Toporkova

  3. European Organization for Nuclear Research (CERN), 1211 , Geneva 23, Switzerland

    Alexey Tselishchev

Authors
  1. Victor Toporkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Toporkova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexey Tselishchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dmitry Yemelyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor Toporkov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Toporkov, V., Toporkova, A., Tselishchev, A. et al. Slot selection algorithms in distributed computing. J Supercomput 69, 53–60 (2014). https://doi.org/10.1007/s11227-014-1210-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-014-1210-1

Keywords

Search

Navigation