Improved Model of Scheduling Algorithm

Abstract

Cluster computing is becoming increasingly practical for high performance computing research and development. A computer cluster is a set of connected computers that work together so that, they can be viewed as a single system. Clusters offer a scalable means of linking computers together to provide an expansive environment for hosting enterprise applications. As the number of nodes in cluster configurations grows, the cluster administration becomes more challenging. We need to study the challenges of cluster management and to provide a solution. To have an effective cluster management we need to have an effective task scheduling algorithm. With the explosive growth of information, the demand on computing is sharply increasing. Due to a large number of computing tasks, the scheduling algorithm is an important part of cluster computing and has a great influence on the quality of claster service. In cluster computing, some large tasks may occupy too many resources and some small tasks may wait for a long time based on First-In-First-Out (FIFO) scheduling algorithm. This paper provides an overview of an improved scheduling algorithm that shortens the execution time of tasks and increases the resource utilization.