Optimal Preemptive Scheduling on Two-Processor Systems

Authors:
R. R. Muntz;E. G. Coffman
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1969

Citing 4
Cited 10

Production and Stabilization of Real-Time Task Schedules

Journal of the ACM (JACM)
Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings

Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings
Scheduling of computations on multiprocessor systems: the preemptive assignment discipline

Scheduling of computations on multiprocessor systems: the preemptive assignment discipline
Generalized multiprocessing and multiprogramming systems

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference

Analysis of a level algorithm for preemptive scheduling

SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines

Information Processing Letters
Parallel Generation of Binary Search Trees

IEEE Transactions on Computers
On the Memory Conflict Problem in Multiprocessor Systems

IEEE Transactions on Computers
Scheduling Trees in Parallel/Pipelined Processing Environments

IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

IEEE Transactions on Computers
Online scheduling of equal-processing-time task systems

Theoretical Computer Science
Scheduling on parallel machines with preemption and transportation delays

Computers and Operations Research
Robust algorithms for preemptive scheduling

ESA'11 Proceedings of the 19th European conference on Algorithms
Optimal preemptive scheduling on a fixed number of identical parallel machines

Operations Research Letters

Quantified Score

Hi-index	14.99

Visualization

Abstract

One of the important potentials of multiprocessor systems is the ability to speed the completion of a computation by concurrently processing independent portions of the job. In this paper we consider the static scheduling of computations for a system containing two indentical processors. The object is to complete the computation in the minimum amount of time. A computation is assumed to be specified as a partially ordered set of tasks and the execution time for each task. A solution for the two-machine case with preemptive scheduling is presented.