.png){kind=icon}
返回
Selecting the most fitting resource for task execution
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2010.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the computing grid task scheduling in order to discover resources for user s requirements is important In general the task scheduler assigns tasks to a proper resource node for execution and the resource nodes with better performance would be assigned first When task loading is heavy and all resource nodes with better performance are assigned other tasks have to be assigned to the resource nodes with inferior performance Therefore if a task is assigned to a resource node without considering the performance factor the overall execution time will increase obviously To solve this problem a task scheduling algorithm that searches for the proper resource for task execution is proposed in this paper Simulation results show that the proposed algorithm works well in dynamic environments (C) 2010 Elsevier B V All rights reserved
Keyword:
Computing grids
Task scheduling
Resource selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
SCF Minimal Basis Set Calculations and Exclusive Orbitals for CN−, HCN, N3−, HN3, NCO−, and HNCO
PREAI
分享收藏
查看更多内容