.png){kind=icon}
返回
Task distribution with a random overlay network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2005.11.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of tasks by forwarding the service requests on an overlay network comprised on random cycles. We introduce algorithms for the creation, maintenance and repair of the overlay network. We discuss two algorithms, random wandering and weighted stochastic forwarding, for the allocation of the tasks to providers. Both approaches are highly scalable because the algorithms use only limited local information. As we are designing our approach for use in a commercial setting, there is a requirement that the tasks, being a source of profits, be allocated fairly to the providers. We investigate the fairness of the algorithms and show that adding a random pre-walk can improve the fairness. Through a simulation study we show that the approach provides efficient task allocation on networks loaded up to 95% of their capacity. Published by Elsevier B.V.
Keyword:
grid computing
commodity computers
routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid
PREAI
分享收藏分享收藏
查看更多内容