Premptive Job Scheduling with Priorities and Starvation cum Congestion Avoidance in Clusters

2010 Second International Conference on Machine Learning and Computing Pub Date : 2010-02-09 DOI:10.1109/ICMLC.2010.60

M. Balajee, B. Suresh, M. Suneetha, V. Rani, G. Veerraju

{"title":"Premptive Job Scheduling with Priorities and Starvation cum Congestion Avoidance in Clusters","authors":"M. Balajee, B. Suresh, M. Suneetha, V. Rani, G. Veerraju","doi":"10.1109/ICMLC.2010.60","DOIUrl":null,"url":null,"abstract":"This paper describes a new policy to schedule parallel jobs on Clusters that may be part of a Computational Grid. This algorithm proposed 3 Job Queues. In each Cluster, some number of resources is assigned to each of the Queue. The 1st Queue has some jobs which has low expected execution time(EET). The 2nd Queue has some jobs which has high expected execution time. The 3rd Queue has jobs which are part of Meta-Job from Computational Grid. In 1st there is no chance of starvation. But in 2nd Queue there is a chance of starvation. So this algorithm applied Aging technique to preempt the jobs which has low priority. And the 3rd Queue is fully dedicated to execute a part of Meta-Jobs only. So here we maintain multiple job Queues which are effectively separate jobs according to their projected execution time for Local Jobs and for part of Meta-Job. Here we preempt jobs by applying Aging Technique. Here we can avoid unnecessary traffic congestion in networks by comparing Expected Execution Time with Total Time for submitting job(s) and receiving result(s) from node(s).","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Machine Learning and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2010.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

Abstract

This paper describes a new policy to schedule parallel jobs on Clusters that may be part of a Computational Grid. This algorithm proposed 3 Job Queues. In each Cluster, some number of resources is assigned to each of the Queue. The 1st Queue has some jobs which has low expected execution time(EET). The 2nd Queue has some jobs which has high expected execution time. The 3rd Queue has jobs which are part of Meta-Job from Computational Grid. In 1st there is no chance of starvation. But in 2nd Queue there is a chance of starvation. So this algorithm applied Aging technique to preempt the jobs which has low priority. And the 3rd Queue is fully dedicated to execute a part of Meta-Jobs only. So here we maintain multiple job Queues which are effectively separate jobs according to their projected execution time for Local Jobs and for part of Meta-Job. Here we preempt jobs by applying Aging Technique. Here we can avoid unnecessary traffic congestion in networks by comparing Expected Execution Time with Total Time for submitting job(s) and receiving result(s) from node(s).

查看原文本刊更多论文

集群中具有优先级和饥饿与拥塞避免的抢占作业调度

本文描述了一种新的策略来调度集群上的并行作业，集群可能是计算网格的一部分。该算法提出了3个作业队列。在每个Cluster中，将一定数量的资源分配给每个Queue。第一个队列有一些预期执行时间(EET)较低的作业。第二个队列有一些作业，它们的预期执行时间很高。第三队列的作业是来自计算网格的元作业的一部分。在第一层，没有饿死的可能。但在第二队列中，有可能会饿死。因此，该算法采用老化技术对优先级较低的作业进行抢占。第三队列完全专用于执行元作业的一部分。因此，我们在这里维护多个作业队列，这些作业队列根据本地作业和部分元作业的预计执行时间有效地分离作业。在这里，我们通过使用老化技术来抢占工作。在这里，我们可以通过比较预期执行时间与提交作业和从节点接收结果的总时间来避免网络中不必要的流量拥塞。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2010 Second International Conference on Machine Learning and Computing

自引率

0.00%

发文量