Optimal Scheduling Strategies in a Multiprocessor System

Authors:
C. V. Ramamoorthy;K. M. Chandy;Mario J. Gonzalez
Affiliations:
Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712.;Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712.;Department of Computer Sciences, University of Texas at Austin, Austin, Tex. 78712.
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 0
Cited 21

The effect of operation scheduling on the performance of a data flow computer

IEEE Transactions on Computers
Design Space Exploration for Data Path Synthesis

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Optimal task scheduling algorithm for cyclic synchronous tasks in general multiprocessor networks

Journal of Parallel and Distributed Computing
On multiprocessor task scheduling using efficient state space search approaches

Journal of Parallel and Distributed Computing
On the Memory Conflict Problem in Multiprocessor Systems

IEEE Transactions on Computers
Scheduling Parallel Processable Tasks for a Uniprocessor

IEEE Transactions on Computers
A Computation Model of Parallel Solution of Linear Equations

IEEE Transactions on Computers
High-Speed Multiprocessors and Compilation Techniques

IEEE Transactions on Computers
Toward Optimization of Horizontal Microprograms

IEEE Transactions on Computers
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers
Scheduling Trees in Parallel/Pipelined Processing Environments

IEEE Transactions on Computers
On the Computational Complexity of a Generalized Scheduling Problem

IEEE Transactions on Computers
Parallel Task Execution in a Decentralized System

IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

IEEE Transactions on Computers
Optimal Parallel Scheduling of Gaussian Elimination DAG's

IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

IEEE Transactions on Computers
Improving the computation of lower bounds for optimal schedules

IBM Journal of Research and Development
Scheduling as a graph transformation

IBM Journal of Research and Development
Computation of lower bounds for multiprocessor schedules

IBM Journal of Research and Development
Scalable scheduling algorithms for wireless networkedcontrol systems

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Resource Minimization for Real-Time Applications Using Computer Clouds

UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing

Quantified Score

Hi-index	15.02

Visualization

Abstract

This paper describes a set of techniques that can be used to optimally schedule a sequence of interrelated computational tasks on a multiprocessor computer system. Using a directed graph model to represent a computational process, two basic problems are solved here. First, given a set of computational tasks and the relationships between them, the tasks are scheduled such that the total execution time is minimized, and the minimum number of processors required to realize this schedule is obtained. The second problem is of a more general nature. Given k processors, the tasks are scheduled such that execution time is again minimized. Consideration is given to tasks of equal and unequal duration, and task preemption is not allowed.