Scheduling Parallel Processable Tasks for a Uniprocessor.
TEXAS UNIV AUSTIN ELECTRONICS RESEARCH CENTER
Pagination or Media Count:
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
- Computer Hardware