首页> 外文期刊>International Journal of Soft Computing and Software Engineering >An Efficient Method for Improving Backfill Job Scheduling Algorithm in Cluster Computing Systems
【24h】

An Efficient Method for Improving Backfill Job Scheduling Algorithm in Cluster Computing Systems

机译:集群计算系统中回填作业调度算法的一种有效改进方法

获取原文
       

摘要

One of the most important issues in cluster computing systems is the efficient use of resources to increase the performance of systems and hence decrease their response times. These objectives can best be pursued by job schedulers in cluster computing systems. However, existing schedulers in cluster computing systems do not use resources efficiently. This paper proposes a new method for efficient allocation of submitted jobs to resources. Jobs consist of threads that are arranged in a two-dimensional matrix. Using the horizontal scanning of this matrix, threads of different jobs are allocated to different processors, preventing resources becoming idle. In previous method of scheduling, the resources are allocated to total threads of a job synchronization but in proposed method, the resources are allocated to threads of various jobs. In new method if there aren’t available resources enough for a job, threads of different jobs can run thus waste of resources are minimum. Simulation results of our proposed scheduling method show quicker cluster system response time than FCFS and Backfilling scheduling methods.
机译:集群计算系统中最重要的问题之一是资源的有效利用,以提高系统的性能,从而减少其响应时间。这些目标可以由群集计算系统中的作业调度程序最好地实现。但是,群集计算系统中的现有调度程序无法有效利用资源。本文提出了一种新方法,可以有效地将提交的作业分配给资源。作业由按二维矩阵排列的线程组成。使用此矩阵的水平扫描,将不同作业的线程分配给不同的处理器,从而防止资源变得空闲。在先前的调度方法中,将资源分配给作业同步的全部线程,但是在提出的方法中,将资源分配给各个作业的线程。在新方法中,如果没有足够的资源来执行某项任务,则可以运行不同任务的线程,因此可以减少资源浪费。我们提出的调度方法的仿真结果显示,群集系统的响应时间比FCFS和回填调度方法更快。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号