.png){kind=icon}
返回
Fair scheduling algorithms in grids
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2007.1053.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a new algorithm for fair scheduling, and we compare it to other scheduling schemes such as the Earliest Deadline First ( EDF) and the First Come First Served ( FCFS) schemes. Our algorithm uses a max- min fair sharing approach for providing fair access to users. When there is no shortage of resources, the algorithm assigns to each task enough computational power for it to finish within its deadline. When there is congestion, the main idea is to fairly reduce the CPU rates assigned to the tasks so that the share of resources that each user gets is proportional to the user's weight. The weight of a user may be defined as the user's contribution to the infrastructure or the price he is willing to pay for services or any other socioeconomic consideration. In our algorithms, all tasks whose requirements are lower than their fair share CPU rate are served at their demanded CPU rates. However, the CPU rates of tasks whose requirements are larger than their fair share CPU rate are reduced to fit the total available computational capacity in a fair manner. Three different versions of fair scheduling are adopted in this paper: the Simple Fair Task Order ( SFTO), which schedules the tasks according to their respective fair completion times, the Adjusted Fair Task Order ( AFTO), which refines the SFTO policy by ordering the tasks using the adjusted fair completion time, and the Max- Min Fair Share ( MMFS) scheduling policy, which simultaneously addresses the problem of finding a fair task order and assigning a processor to each task based on a max- min fair sharing policy. Experimental results and comparisons with traditional scheduling schemes such as the EDF and the FCFS are presented using three different error criteria. Validation of the simulations using real experiments of tasks generated from 3D imagerendering processes is also provided. The three proposed scheduling schemes can be integrated into existing Grid computing architectures.
Keyword:
grid computing
fair grid scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Recurrence of Subdural Haematoma in a Population-Based Cohort – Risks and Predictive Factors.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏The GrADS project: Software support for high-level grid application developmentGrADS项目: 高级网格应用程序开发的软件支持
PREAI
分享收藏
查看更多内容