Performance of a Few Gang Scheduling Algorithms for Multiprocessor Scheduling
Year: 2013
Type: preprint
Abstract: In this study, the performance of several approximation algorithms for multiprocessor scheduling is considered. Multiprocessor scheduling is an NP-hard problem which means that it may not be possible to design exact algorithms to solve this problem to optimality. Therefore, designing of approximation algorithms to solve this problem appears to be the only option available. The algorithms considered are designed incorporating the gang scheduling approach. An attempt is made to obtain solutions close to optimal using these algorithms. The study shows that these algorithms can be used to solve even large-scale problems occurring in practice.
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: W112160933