Dynamic Multilevel Dual Queue Scheduling Algorithms for Grid Computing

Abstract

Grid computing is the enabling technology for high performance computing in scientific and large scale applications. Grid computing introduces a number of fascinating issues to resource management. Grid scheduling is a vital component of a Grid infrastructure. Reliability, efficiency (in terms of time consumption) and effectiveness in resource utilization are the desired quality attributes of Grid scheduling systems. Many algorithms have been developed for Grid scheduling. In our previous work, we proposed two scheduling algorithms (the Multilevel Hybrid Scheduling Algorithm and the Multilevel Dual Queue Scheduling Algorithm) for optimum utilization of CPUs in a Grid computing environment. In this paper, we propose two more flavours of Multilevel Dual Queue scheduling algorithms, i.e. the Dynamic Multilevel Dual Queue Scheduling Algorithm using Median and the Dynamic Multilevel Dual Queue Scheduling Algorithm using Square root. We evaluate our proposed Grid scheduling, in comparison to other well known scheduling algorithms, on an SGI super computer using parts of the ‘AuverGrid’ workload trace.