Composite Scheduling Strategies in Distributed Computing with Non-dedicated Resources | Zendy

Victor Toporkov | Zendy; Alexey Tselishchev | Zendy; Dmitry Yemelyanov | Zendy; Alexander Bobchenkov | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Composite Scheduling Strategies in Distributed Computing with Non-dedicated Resources

Author(s) -

Victor Toporkov,

Alexey Tselishchev,

Dmitry Yemelyanov,

Alexander Bobchenkov

Publication year - 2012

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2012.04.019

Subject(s) - computer science , distributed computing , scheduling (production processes) , job scheduler , processor scheduling , computation , dynamic priority scheduling , resource (disambiguation) , schedule , computer network , mathematical optimization , operating system , cloud computing , algorithm , mathematics

This work presents dispatching strategies based on methods of job-flow and application-level scheduling in virtual organizations of distributed computational environments with non-dedicated resources. Job-flow management is implemented with the set of specific rules for resource usage. Applications are considered as parallel jobs. Strategies are based on economic scheduling models and diverse administration policies inside resource domains (clusters, computational nodes equipped with multicore processors etc.). Methods of priority economic scheduling of global job flows and local-level applications in distributed computations are studied. Job management structures and economic mechanisms for load balancing in distributed environments are considered

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research