research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:chita
TitleFair Execution Time Estimation Scheduling in Computational Grids
Bibtex cite IDRACTI-RU1-2008-51
Booktitle 7th International Conference on Distributed and Parallel Systems (DAPSYS 2008)
Year published 2008
Month September
Pages 93-104
Publisher Springer US
Location Debrecen, Hungary
Note Distributed and Parallel Systems
DOI 10.1007/978-0-387-79448-8
Keywords grids - scheduling - fairness - task workload
We propose a fair scheduling algorithm for Computational Grids, called Fair Execution Time Estimation (FETE) algorithm. FETE assigns a task to the computation resource that minimizes what we call its fair execution time estimation. The fair execution time of a task on a certain resource is an estimation of the time by which a task will be executed on the resource, assuming it gets a fair share of the resource’s computational power. Though space-shared scheduling is used in practice, the estimates of the fair execution times are obtained assuming that a time-sharing discipline is used. We experimentally evaluate the proposed algorithm and observe that it outperforms other known scheduling algorithms. We also propose a version of FETE, called Simple FETE (SFETE), which requires no a-priori knowledge of the tasks workload and in most cases has similar performance to that of FETE.
Dafouli, H
Kokkinos, Panagiotis
Varvarigos, Emmanouel
dapsys08_fair_v5.pdf (main file)
Publication ID502