An online scheduling algorithm for a two layer multiprocessor architecture
Cs. Imreh · 2001
In this paper we give online algorithms and competitive ratio bounds for a scheduling problem on the following two-layer architecture. The architecture consists of two sets of processors; within each set the processors are identical while both the processors themselves and their numbers may differ between the sets. The scheduler has to make an online assigment of jobs to one of the two processor sets. Jobs, assigned to a processor set, are then sceduled in an optimal o ine preemptive way within the processor set considered. The scheduler's task is to minimize the maximum of the two makespans of the processor sets.