On the Computational Complexity of a Generalized Scheduling Problem

Authors:
K. Vairavan;R. A. Demillo
Affiliations:
Department of Electrical Engineering, University of Wisconsin-Milwaukee;-
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 7
Cited 1

Operating Systems Theory

Operating Systems Theory
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Parallel scheduling of programs in a restricted model of computation

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Optimal Scheduling Strategies in a Multiprocessor System

IEEE Transactions on Computers
Parallel program schemata

Journal of Computer and System Sciences
NP-complete scheduling problems

Journal of Computer and System Sciences
On formalised computer programs

Journal of Computer and System Sciences

A Generalized Scheme for Mapping Parallel Algorithms

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

The parallel scheduling of a partially ordered set of tasks has received great attention. The partially ordered tasks can be viewed as components of a straight-line program. In this note, we discuss some aspects of the nonpreemptive parallel scheduling of a program with more general control structures. We examine the existence of optimal k-processor schedules, and in line with recent interest in the complexity of computer computations and algorithms, we study the complexity of constructing optimal k-processor schedules. In particular we show that, for every k 1, any algorithm that would yield an optimal k-processor schedule of a loop-free program, when such a schedule exists, will be of exponential-time complexity.