BGPS :A Scheduling Algorithm for Batch Pipeline Resources using GA
Arash Ghorbannia Delavar, Ayden Halakouie · 2012
In this paper, we will present a scheduling algorithm for batch pipeline resources using GA. BGPS algorithms for resource allocation with variable processing power to the jobs is offered. In previous algorithms, a source could select and run one job at a time. New techniques can batch jobs and perform them in parallel. so after the first job is completed, second job is started simultaneously. The BGPS algorithm can reduce wasting time of sweeping jobs. And we can have the optimal use of existing resources. The new algorithm, in comparison to a similar algorithm with a bunch of jobs, can run them in a pipline. It will be able to request and confirmation of job after the end of previous job, and also allocate resources to perform jobs in parallel. The system is capable to accelerate of processing tasks with different parameters in function and increase system efficiency.