Scheduling Parallel Processable Tasks for a Uniprocessor.

Abstract

Parallel Processable source program segments are scheduled so that multiprogramming can occur between them. Optimal and near-optimal methods of scheduling are examined. The heuristic methods are shown to be preferable to the optimal methods. The effect of inaccurate estimates of the time requirements of the program segments are considered. Memory constraints on the possible schedules are also evaluated. Implementation of the scheduling schemes is discussed. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 10, 1973
Accession Number
AD0760143

Entities

People

  • C. V. Ramamoorthy
  • Thomas Francis Fox

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Computing-Related Activities
  • Engineering
  • Heuristic Methods
  • Multiprogramming
  • Scheduling (Production)

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design