Near-optimal multiprocessor scheduling

Authors:
Farideh A. Samadzadeh;G. E. Hedrick
Affiliations:
Computer Science Department, Oklahoma State University, Stillwater, OK;Computer Science Department, Oklahoma State University, Stillwater, OK
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 6
Cited 1

Discrete mathematics with computer science applications

Discrete mathematics with computer science applications
Applications of the Connection Machine

Computer
A Survey of Some Theoretical Aspects of Multiprocessing

ACM Computing Surveys (CSUR)
Knowledge-Based Approaches for Scheduling Problems: A Survey

IEEE Transactions on Knowledge and Data Engineering
Stochastic models of multiple and time-shared computer operations.

Stochastic models of multiple and time-shared computer operations.
On program restructuring, scheduling, and communication for parallel processor systems

On program restructuring, scheduling, and communication for parallel processor systems

A heuristic multiprocessor scheduling algorithm for creating near-optimal schedules using task system graphs

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problems in employing several processors to execute a program can be identified as: a) discovering the potential parallelism of execution in different portions of the same program, and b) scheduling of the resulting task system. This research concentrates on the latter problem. More specifically, this research focuses on designing graph-based scheduling algorithms that produce near-optimal schedules using task system graphs. It is possible for the tasks in a task system to be completely disjoint, or to be interdependent. Algorithms suitable for scheduling of dependent and independent tasks are presented and discussed.