Reconfigurable Gang Scheduling Algorithm


 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of an algorithm that is capable of dynamically changing its form (configuration) into a more appropriate one, according to environment variations and user requirements. In this paper… (More)
DOI: 10.1007/11407522_5


18 Figures and Tables

Slides referencing similar topics