New Backfilling Algorithm for Multiprocessor Scheduling with Gang Scheduling
Ruwanthini Siyambalapitiya, Manjula Sandirigama · SSRN Electronic Journal · 2011
In this study, we propose an efficient algorithm for the multiprocessor job scheduling problem. From a given list of jobs, jobs are queued according to the decreasing order of their durations. Depending upon the job duration, jobs are divided into multiple threads for processing. Multithread jobs are processed based on the concept of ‘gang scheduling.’ To minimize the idle time of the processors, backfilling approach is incorporated into the algorithm.