Scalable low complexity task scheduling algorithm for cluster of workstations

Static scheduling is the temporal and spatial mapping of a program to the resources of parallel system. scheduling algorithms use the directed cyclic graph (dag) to represent sub-tasks and the precedence constraints of the program to be parallelized. it has been shown to be np-complete in general as well as in several restricted cases. this paper proposes a scalable,low complexity performance effective task scheduling algorithm whose time complexity is o((e) (p + log v)). it provides effective result for applications represented by dags. experiments have been conducted based on randomly generated graphs which show that the proposed algorithm outperforms the existing algorithms. © school of engineering,taylor's university college.