首页    期刊浏览 2024年09月20日 星期五
登录注册

文章基本信息

  • 标题:A study on Task Scheduling Algorithms in Grids
  • 本地全文:下载
  • 作者:W.Viyakulamary ; T.Kokilavani
  • 期刊名称:International Journal of Engineering and Computer Science
  • 印刷版ISSN:2319-7242
  • 出版年度:2015
  • 卷号:4
  • 期号:8
  • 页码:13934-13947
  • DOI:10.18535/ijecs/v4i8.56
  • 出版社:IJECS
  • 摘要:Grid computing is the collaboration of interconnected computing resources ready to be served for the user’s request for complexand time consuming processes. Task scheduling is one among the thrust research areas of grid computing as it can be viewed as an NPcompleteproblem. Task scheduling is still complicated as the resources in the grid environment have unique characteristics in nature. Thus,the allocations of resources have limited opportunities in finding out the optimal solution. Over the past decades, many researches have beenproposed on heuristics task scheduling algorithms that contributed a substantial impact on the performance of task scheduling.Unfortunately, the algorithms are still lacking in producing cent percent of optimal solution in the allocation of resources to the needysystems. The evaluations of the optimal solution are also found more difficult to prove the efficiency of the algorithms. Therefore, this reviewis motivated to present the depth study on grid computing environment, existing heuristics scheduling algorithms and their significances.This paper also includes the comparative analysis of the reviewed algorithms using the most dominating parameters.
  • 关键词:grid; tasks; resources; NP-complete; Heuristics
国家哲学社会科学文献中心版权所有