CAJ | 학술논문

在计算能力调度算法中没有全面考虑各资源特征的分配是否满足作业多样的服务要求，提出一种基于优先级的计算能力加权调度算法，根据作业的优先级以及提交时间等因素来计算作业的权重。依据作业的权重对作业队列进行排序并分配空闲的slot给队首的作业，从而避免调度陷入局部最优也能更好地满足作业的多样性服务要求。在搭建的Hadoop平台上进行实验表明，改进后的算法能较均衡地分配系统资源减少一些作业的等待时间，并且运行全部作业的用时有所减少。
재계산능력조도산법중몰유전면고필각자원특정적분배시부만족작업다양적복무요구，제출일충기우우선급적계산능력가권조도산법，근거작업적우선급이급제교시간등인소래계산작업적권중。의거작업적권중대작업대렬진행배서병분배공한적slot급대수적작업，종이피면조도함입국부최우야능경호지만족작업적다양성복무요구。재탑건적Hadoop평태상진행실험표명，개진후적산법능교균형지분배계통자원감소일사작업적등대시간，병차운행전부작업적용시유소감소。
Among capacity scheduling algorithms, it is not fully taken into account whether the allocation of resources meets job varied service requirements. This paper presents a priority based weighted capacity scheduling algorithm which calculates the weight based on the priority of jobs, job’s wait time and other factors of job. Based on the weight of the job to sort the job queue and assign free slot to the team’s first job, so as to avoid falling into local optimal solution and better meet job varied service requirements. Experimental results on Hadoop platform show that improved algorithm can be more balanced with the resources, reduce waiting time for some jobs, and decrease the total run time of the job.