Elsevier

Journal of Algorithms

Volume 4, Issue 4, December 1983, Pages 353-362
Journal of Algorithms

Nearly on-line scheduling of multiprocessor systems with memories

https://doi.org/10.1016/0196-6774(83)90016-0Get rights and content

Abstract

We show that no multiprocessor system that contains at least one processor with memory size smaller than at least two other processors can be scheduled nearly on-line to minimize the finish time. An efficient nearly on-line algorithm to minimize Cmax is developed for multiprocessor systems that do not satisfy the preceding requirement.

References (10)

  • M.R Garey et al.

    Computers and Intractability, a Guide to the Theory of NP-Completeness

    (1979)
  • T Gonzalez et al.

    A new algorithm for preemptive scheduling of trees

    J. Assoc. Comput. Mach.

    (1980)
  • T Gonzalez et al.

    Preemptive scheduling of uniform processor systems

    J. Assoc. Comput. Mach.

    (1978)
  • D.G Kafura et al.

    Task scheduling on a multiprocessor system with independent memories

    SICOMP

    (1977)
  • J Labetoulle et al.

    Preemptive Scheduling of Uniform Machines Subject to Release Dates

There are more references available in the full text version of this article.

Cited by (0)

The research reported here was supported, in part, by the Office of Naval Research under Contract N00014-80-C-0650.

View full text