Nearly on Line Scheduling of Multiprocessor Systems with Memories.

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 C-sub-max is developed for multiprocessor systems that do not satisfy the preceding requirement. Finally, we review the complexity of some other scheduling problems for multiporcessor systems with memories. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1982
Accession Number
ADA116823

Entities

People

  • Sartaj Sahni
  • Ten-hwang Lai

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Control Systems Engineering
  • Engineering
  • Intervals
  • Linear Programming
  • Mathematics
  • Military Research
  • Minnesota
  • Multiprocessors
  • Numbers
  • Operations Research
  • Rational Numbers
  • Scheduling (Production)
  • Time Intervals
  • Universities

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design