Job-flow Anticipation Scheduling in Grid
| Autor: | Victor V. Toporkov, Dmitry Yemelyanov, Alexander Bobchenkov |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Rate-monotonic scheduling
Earliest deadline first scheduling 020203 distributed computing Computer science Heuristic Distributed computing Scheduling (production processes) 02 engineering and technology Flow shop scheduling Dynamic priority scheduling Round-robin scheduling Grid Fair-share scheduling Stride scheduling Deadline-monotonic scheduling Scheduling (computing) Fixed-priority pre-emptive scheduling Genetic algorithm scheduling Two-level scheduling Lottery scheduling 0202 electrical engineering electronic engineering information engineering General Earth and Planetary Sciences 020201 artificial intelligence & image processing General Environmental Science |
| Zdroj: | ICCS |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2017.05.011 |
| Popis: | In this paper, a heuristic user job-flow scheduling approach for Grid virtual organizations with non-dedicated resources is discussed. Users’ and resource providers’ preferences, virtual organization’s internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding decision space are reduced. This further complicates the task of efficient scheduling. In order to improve overall scheduling efficiency we propose a heuristic anticipation scheduling approach. Initially it generates a near optimal but infeasible scheduling solution which is then used as a reference for efficient resources allocation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|