Preference-based Fair Resource Sharing and Scheduling Optimization in Grid VOs | Zendy

Victor Toporkov | Zendy; Anna Toporkova | Zendy; Alexey Tselishchev | Zendy; Dmitry Yemelyanov | Zendy; Petr Potekhin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Preference-based Fair Resource Sharing and Scheduling Optimization in Grid VOs

Author(s) -

Victor Toporkov,

Anna Toporkova,

Alexey Tselishchev,

Dmitry Yemelyanov,

Petr Potekhin

Publication year - 2014

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.2014.05.075

Subject(s) - computer science , reservation , scheduling (production processes) , grid , shared resource , distributed computing , operations research , quality of service , job scheduler , mathematical optimization , computer network , geometry , mathematics , engineering , queue

In this paper, we deal with problems of efficient resource management and scheduling in utility Grids. There are global job flows from external users along with resource owners’ local tasks upon resource non-dedication condition. Competition for resource reservation between independent users, local and global job flows substantially complicates scheduling and the requirement to provide the necessary quality of service. A meta-scheduling model, justified in this work, assumes a complex combination of job flow dispatching and application-level scheduling methods for jobs, as well as resource sharing and consumption policies established in virtual organizations (VOs) and based on economic principles. A solution to the problem of fair resource sharing among VO stakeholders with simulation studies is proposed

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