arrow
返回

Task assignment policies in distributed server systems: A survey

delete2011-07-01
delete23
PRE
AI
F
Fouzi Semchedine *
L
Louiza Bouallouche‐Medjkoune
D
Djamil Aı̈ssani
DOI:10.1016/j.jnca.2011.01.011delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Data intensive computing, in the Web environment, motivates the distributed designs of Web server systems (Web clusters) because of their scalability and cost-effectiveness instead of one Web server with high performance. The task assignment policy, in such systems, focuses on the manner of assigning the tasks that reach these systems (e.g. the case of intensive requests that reach the distributed Web server systems) in order to minimize the response time and thus, improve the performance. These tasks, generally, follow the heavy-tailed distribution which has the property that there is a tiny fraction (about 3%) of large tasks that makes half (50%) of the total load. Several policies were proposed in the literature to deal with the nature of this Web traffic. This paper presents a state-of-art of the existing task assignment policies. We classify these policies in two classes: policies which assume that the task size is known a priori, and policies which assume that the task size is not known a priori (like TAGS, TAPTF and TAPTF-WC). The first class of policies regroups policies which consider no knowledge of load information at the servers when assigning the incoming tasks, known as static policies (like Random, Round Robin, etc.) and, policies, known as dynamic policies (like Central Queue Policy, Least Loaded First LLF, etc.) which use some load information (e.g. the processing capacity, the queue load, etc.) to process. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Data intensive computing
Task assignment
Distributed server systems
Heavy-tailed distribution
Load balancing
Load sharing
Performance
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Journal of Network and Computer Applications 封面图
Journal of Network and Computer Applications
IF:
8
论文数:
3.6K
被引数:
1.1W

机构

暂无机构信息
引用论文

引用论文

学者 查看更多内容