An online scheduling algorithm for a two-layer multiprocessor architecture

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

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

Download (814kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2001
Volume: 15
Number: 2
ISSN: 0324-721X
Page Range: pp. 163-172
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (2.) (2000) (Szeged)
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika, Algoritmus
Additional Information: Bibliogr.: 172. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 12:46

Actions (login required)

View Item View Item