International Journal of Computer Science Issues

More than a traditional journal...

In this paper we consider the problem of allocating independent heterogeneous tasks on grid environment in which A new batching heuristic scheduling algorithm with Taking index parameters will be presented. Reference to tasks compute scheduling, several methods are evaluated. With compare Min-mean and Improved Min-mean algorithms, we can create the specific situation that BPISG algorithm can be more efficient and more dependable than similar than previous algorithms. With taking the round time, consist acknowledgement and return time parameters, specific functionality has been created. With implementation these parameters in the simulate environment, we can create situation that scheduling task will be done with better position and achieve high performance on computational grids. Finally the experiment and simulated results will show that the BPISG heuristic scheduling algorithm performs significantly to ensure high throughput, reduced makespan and more efficient in the grid environment.