Performance of critical path type algorithms for scheduling on parallel processors

Authors:
Gaurav Singh
Affiliations:
Department of Mathematical Sciences, University of Technology, Sydney, NSW 2007, Australia
Venue:
Operations Research Letters
Year:
2001

Citing 4
Cited 1

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
The complexity of scheduling trees with communication delays

Journal of Algorithms
Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)
NP-complete scheduling problems

Journal of Computer and System Sciences

A performance study of multiprocessor task scheduling algorithms

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, two well-known NP-hard problems with parallel processors, precedence constraints, unit execution time task systems, and the criterion of maximum lateness, are considered. The first problem has an additional restriction that a task may occupy more than one processor simultaneously, and the second considered problem is a unit communication delay problem. For both problems the worst-case performance of critical path type algorithms is analyzed. All performance guarantees presented are tight for arbitrary large instances of the respective problems.