Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness

In scheduling theory it is widely assumed that a task is to be processed on one processor at a time. This assumption is not so obvious in the context of recently emerging parallel computer systems and parallel algorithms. In this work we consider tasks requiring more than one dedicated processor at...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 72; no. 1; pp. 25 - 46
Main Authors:	Bianco, L., Błażewicz, J., Dell'Olmo, P., Drozdowski, M.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 10.01.1997
Subjects:	Linear time algorithms Multiprocessor tasks scheduling Parallel processing Parallel processing Multiprocessor tasks scheduling Linear time algorithms
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In scheduling theory it is widely assumed that a task is to be processed on one processor at a time. This assumption is not so obvious in the context of recently emerging parallel computer systems and parallel algorithms. In this work we consider tasks requiring more than one dedicated processor at a time, i.e. sets of processors simultaneously. Linear time algorithms will be given for the case of two, three and four processors and the L max criterion. The algorithms are based on the same simple paradigm. In some cases they deliver optimal solutions. In other cases, optimality is not guaranteed but they can still be used as fast approximation algorithms for which the worst case performance bounds are given. Results of the computational experiments involving four processors are reported.
ISSN:	0166-218X 1872-6771
DOI:	10.1016/S0166-218X(96)00035-2