Description: Parallel job scheduler is important to High Performance Computing system. The kernel function is to choose a job to execute whenever a scheduling event happens. The simplest policy is FCFS. This approach suffers from low system utilization. EASY Backfilling[4]was proposed to improve system utilization and has been implemented in several production schedulers. The main problem with EASY is that it requires estimates of job runtimes to be available. Another problem is that it moves forwards as many smaller jobs as possible. It is unfair to the larger ones. To attack these problems, we propose a new method, Priority-based Preemptive Scheduling.
To Search:
File list (Check if you may need any files):
keqiangzhanshiduanzuoye.doc
Download