Preemptive Scheduling of a Multiprocessor System with Memories To Minimize L(MAX).

Abstract

We develop an O(K(sq)n + nlogn) algorithm to obtain a preemptive schedule that minimizes L sub max when n jobs with given memory requirements are to be scheduled on m processors (n > or = m) of given memory sizes. k is the number of distinct due dates. The value of the minimum L sub max can itself be found in O(kn + nlogn) time. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA103795

Entities

People

  • Sartaj Sahni
  • Ten Hwang Lai

Organizations

  • University of Minnesota

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Flow Network
  • Inequalities
  • Intervals
  • Mathematics
  • Minnesota
  • Multiprocessors
  • Processing Equipment
  • Scheduling (Production)
  • Time Intervals
  • Universities

Readers

  • Analytical Mechanics
  • Parallel and Distributed Computing.