A note on MULTIFIT scheduling for uniform machines

A note on MULTIFIT scheduling for uniform machines

In this note, we derive the tight worst case bound square root 6/2+( one half ) super(k) for scheduling with the MULTIFIT heuristic on two parallel uniform machines with k calls of FFD within MULTIFIT. When MULTIFIT is combined with LPT as an incumbent algorithm the worst case bound decreases to squ...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computing 1998-01, Vol.61 (3), p.277-283
1. Verfasser: BURKARD, R. E
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Computer systems performance. Reliability
Exact sciences and technology
Software
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note, we derive the tight worst case bound square root 6/2+( one half ) super(k) for scheduling with the MULTIFIT heuristic on two parallel uniform machines with k calls of FFD within MULTIFIT. When MULTIFIT is combined with LPT as an incumbent algorithm the worst case bound decreases to square root 2+1/2+( one half ) super(k).
ISSN:0010-485X
1436-5057
DOI:10.1007/BF02684354