Optimal scheduling for two-processor systems

  title={Optimal scheduling for two-processor systems},
  author={Edward G. Coffman and Ronald L. Graham},
  journal={Acta Informatica},
SummaryDespite the recognized potential of multiprocessing little is known concerning the general problem of finding efficient algorithms which compute minimallength schedules for given computations and m≧2 processors. In this paper we formulate a general model of computation structures and exhibit an efficient algorithm for finding optimal nonpreemptive schedules for these structures on two-processor systems. We prove that the algorithm gives optimal solutions and discuss its application to… 
Ideal preemptive schedules on two processors
An extension of the Coffman-Graham algorithm that solves in polynomial time the preemptive counterpart of this problem of finding an ideal nonpreemptive schedule of unit-execution-time jobs with equal release dates and arbitrary precedence constraints on two identical parallel processors is presented.
Performance analysis of multiprocessor systems containing functionally dedicated processors
  • J. LiuC. Liu
  • Computer Science, Business
    Acta Informatica
  • 2004
General models of multiprocessor systems in which processors are functionally dedicated are described, which include the job shop problem in which there is exactly one processor of each type.
An Improved Upper-Bound Algorithm for Non-preemptive Task Scheduling
  • S. AndreiA. ChengV. Radulescu
  • Computer Science, Business
    2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2015
Previous results regarding the minimum number of processors required for getting a feasible schedule and the possible ways of improving the well known traditional scheduling algorithms in the case of non-preemptive, single-instance, multiprocessor systems are extended.
Scheduling interval orders with communication delays in parallel
Branch-and-bound algorithm for UET scheduling problem
  • M. ChardonA. Moukrim
  • Business, Computer Science
    IEEE International Conference on Systems, Man and Cybernetics
  • 2002
A new branch and bound algorithm is proposed to find an optimal schedule in the general case based upon a dominance rule and lower bounds including relaxation of the number of available processors and certain precedence constraints.
Analyzing Branch-and-Bound Algorithms for the Multiprocessor Scheduling Problem
A survey of the wide array of polynomial-time approximation, heuristic, and meta-heuristic based algorithms that exist for solving the Multiprocessor Scheduling Problem finds that Fujita's method does not offer any improvement over the Fernandez bound.
Preemptive Scheduling on Parallel Processors with due dates
It is shown that the presented algorithm constructs an optimal schedule for the problems with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of processors and precedence constraints in the form of an in-tree.
Online scheduling of equal-processing-time task systems


Optimal Preemptive Scheduling on Two-Processor Systems
This paper considers the static scheduling of computations for a system containing two indentical processors and a solution for the two-machine case with preemptive scheduling is presented.
Optimal Sequencing of Two Equivalent Processors
This paper presents an efficient algorithm for a class of sequencing problems in which n tasks with an arbitrary precedence relation have to be processed by two processors of equal ability, and each
Parallel Sequencing and Assembly Line Problems
This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability, and how to arrange a schedule that requires the minimum number of men to complete all jobs within a prescribed time T.
Bounds for certain multiprocessing anomalies
It is known that in multiprocessing systems composed of many identical processing units operating in parallel, certain timing anomalies may occur; e.g., an increase in the number of processing units
Paths, Trees, and Flowers
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An
Three scheduling problems that involve a schedule or timetable of projected operations or jobs occur frequently in operations research and each poses a question about a finite partially ordered set of jobs that can be reformulated in terms of flows in acyclic directed networks.
Scheduling project networks
I t has been found useful to describe a project, a series of interrelated activities or procedures directed toward the accomplishment of some definable goal, by a network of nodes and directed line
The Gantt Chart