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

Authors:
W. H. Kohler
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 15
Cited 7

Production and Stabilization of Real-Time Task Schedules

Journal of the ACM (JACM)
Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Journal of the ACM (JACM)
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F

Journal of the ACM (JACM)
A Survey of Some Theoretical Aspects of Multiprocessing

ACM Computing Surveys (CSUR)
A comparison of list schedules for parallel processing systems

Communications of the ACM
A note on sub-expression ordering in the execution of arithmetic expressions

Communications of the ACM
Operating Systems Theory

Operating Systems Theory
Polynomial complete scheduling problems

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Bounds on scheduling with limited resources

SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem

IEEE Transactions on Computers
Optimal Preemptive Scheduling on Two-Processor Systems

IEEE Transactions on Computers
Priority Assignment in a Network of Computers

IEEE Transactions on Computers
Optimal Scheduling Strategies in a Multiprocessor System

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

IEEE Transactions on Computers

Static scheduling of synchronous data flow programs for digital signal processing

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

IEEE Transactions on Computers
Improvement of duplication scheduling heuristic algorithm with nonstrict triggering of program graph nodes

PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A Statistical Study of the Performance of a Task Scheduling Algorithm

IEEE Transactions on Computers
A new strategy for multiprocessor scheduling of cyclic task graphs

International Journal of High Performance Computing and Networking
Static scheduling of periodic hardware tasks with precedence and deadline constraints on reconfigurable hardware devices

International Journal of Reconfigurable Computing - Special issue on selected papers from the international workshop on reconfigurable communication-centric systems on chips (ReCoSoC' 2010)
Orchestrating stream graphs using model checking

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	14.99

Visualization

Abstract

The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal method is evaluated. The computation is modeled by an acyclic directed graph G(T,