首页    期刊浏览 2024年11月26日 星期二
登录注册

文章基本信息

  • 标题:A PROFICIENT LOW COMPLEXITY ALGORITHM FOR PREEMINENT TASK SCHEDULING INTENDED FOR HETEROGENEOUS ENVIRONMENT
  • 本地全文:下载
  • 作者:D. I. GEORGE AMALARETHINAM ; P. MUTHULAKSHMI
  • 期刊名称:Journal of Theoretical and Applied Information Technology
  • 印刷版ISSN:1992-8645
  • 电子版ISSN:1817-3195
  • 出版年度:2014
  • 卷号:67
  • 期号:1
  • 出版社:Journal of Theoretical and Applied
  • 摘要:The major component of any computing system is the scheduling technique that coordinates the entire system. Heterogeneous environments like grid computing environment provide the accessibility to use wide range of resources that are located around the world. In such environment resource management becomes a complex issue due to various factors like high computational demand, diversity among the tasks, heterogeneity of resources, and heterogeneity of vendors who offer services, dynamic nature of resources. An effective scheduling may increase the efficiency of resource management systems. This paper addresses a grid scheduling algorithm. The algorithm is devised to schedule the tasks on available resources. The performance of the algorithm has been evaluated for arbitrary and regular graphs. The algorithm and the compared algorithms are implemented in Java. The algorithm begins by grouping the tasks. Then tasks from various groups are compared and prioritized for scheduling. The results show that the proposed algorithm outperforms the existing algorithms. The test results of the algorithm justify that the algorithm encourages maximum utilization of resources, minimized makespan and balanced load across resources.
  • 关键词:Resource Finalizing Factor; Load Balancing; Schedule Length; Quick Finish Time; Prominent Parent; Promising Successor.
国家哲学社会科学文献中心版权所有