Improvements to First-Come-First-Served Multiprocessor Scheduling with Gang Scheduling
Year: 2012
Type: preprint
Abstract: This paper proposes an improved algorithm for the multiprocessor job scheduling problem based on First-Come-First-Served (FCFS) strategy. Depending on the job processing times, some jobs are divided into multi-threads while others remain as single thread jobs. Multi-thread jobs are processed based on the concept of gang scheduling. Back filling technique is used to improve the performance of the proposed algorithm. The results of the proposed algorithm are presented using a percentage gap from a lower bound.
Source: SSRN Electronic Journal
Authors: R. Siyambalapitiya, Manjula Sandirigama
Institution: University of Peradeniya
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W69869292