An online scheduling algorithm for a two-layer multiprocessor architecture

Imreh, Csanád: An online scheduling algorithm for a two-layer multiprocessor architecture. Acta cybernetica, (15) 2. pp. 163-172. (2001)

[img] Cikk, tanulmány, mű
cybernetica_015_numb_002_163-172.pdf

Letöltés (814kB)

Absztrakt (kivonat)

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 offline preemptive way within the processor set considered. The scheduler's task is to minimize the maximum of the two makespans of the processor sets.

Mű típusa: Cikk, tanulmány, mű
Konferencia neve: Conference for PhD Students in Computer Science, 2., 2000, Szeged
Befoglaló folyóirat/kiadvány címe: Acta cybernetica
Kötet/évfolyam: 15
Szám: 2
ISSN: 0324-721X
Nyelv: angol
Kulcsszavak: Természettudomány, Informatika
Megjegyzések: Bibliogr.: 172. p.; Abstract
A feltöltés ideje: 2016. okt. 15. 12:25
Utolsó módosítás: 2018. jún. 05. 14:10
URI: http://acta.bibl.u-szeged.hu/id/eprint/12670
Bővebben:
Tétel nézet Tétel nézet