The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1980 vol.29)
pp: 308-316
J. Bruno , Department of Electrical Engineering and Computer Science and the Computer Systems Laboratory, University of California
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.
INDEX TERMS
task system, Deadlines, multiprocessor, pipelined processor, release times, scheduling algorithms
CITATION
J. Bruno, J.W., III Jones, null Kimming So, "Deterministic Scheduling with Pipelined Processors", IEEE Transactions on Computers, vol.29, no. 4, pp. 308-316, April 1980, doi:10.1109/TC.1980.1675569
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool