Fair Scheduling in Grid VOs with Anticipation Heuristic
In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies along with local private utilization impose specific requirements for scheduling according to different, usually contradictive,...
Saved in:
Published in | Parallel Processing and Applied Mathematics Vol. 10778; pp. 145 - 155 |
---|---|
Main Authors | , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2018
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
ISBN | 3319780530 9783319780535 |
ISSN | 0302-9743 1611-3349 |
DOI | 10.1007/978-3-319-78054-2_14 |
Cover
Loading…
Summary: | In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies along with local private utilization impose specific requirements for scheduling according to different, usually contradictive, criteria. We study the problem of a fair job batch scheduling with a relatively limited resources supply. With increasing resources utilization level the available resources set and corresponding decision space are reduced. The main problem is a scarce set of job execution alternatives which eliminates scheduling optimization. In order to improve overall scheduling efficiency we propose a heuristic anticipation approach. It generates a reference, most likely infeasible, scheduling solution. A special replication procedure performs a feasible solution with a minimum distance to a reference alternative under given metrics. |
---|---|
ISBN: | 3319780530 9783319780535 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-319-78054-2_14 |