Deterministic Scheduling with Pipelined Processors

Authors:
J. Bruno;J. W. , III Jones; Kimming So
Affiliations:
Department of Electrical Engineering and Computer Science and the Computer Systems Laboratory, University of California;-;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 1
Cited 5

Scheduling Tasks with Nonuniform Deadlines on Two Processors

Journal of the ACM (JACM)

Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A bound analysis of scheduling instructions on pipelined processors with a maximal delay of one cycle

Parallel Computing
Polynomial-time approximation schemes for scheduling problems with time lags

Journal of Scheduling
Scheduling Multipipeline and Multiprocessor Computers

IEEE Transactions on Computers
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay

Operations Research Letters

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper several results are proven showing a correspondence between problems involving task systems with single-stage processors and similar ones using pipelined processors. For example, an optimal schedule for a task system with arbitrary precedence constraints using a single pipelined processor with two stages is found by the familiar Coffman-Graham algorithm for a system with two single-stage processors. Precedence constraints in the form of inforests, out-forests, and directed acyclic graphs are examined. Task systems with release times and deadlines for each task are also considered.