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

Authors:
Peter J. Denning;G. Scott Graham
Affiliations:
Purdue Univ., Lafayette, IN;Purdue Univ., Lafayette, IN
Venue:
Communications of the ACM
Year:
1973

Citing 1
Cited 2

Subexpression ordering in the execution of arithmetic expressions

Communications of the ACM

Deterministic Processor Scheduling

ACM Computing Surveys (CSUR)
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

IEEE Transactions on Computers

Quantified Score

Hi-index	48.22

Visualization

Abstract

A counterexample to the supposed optimality of an algorithm for generating schedules for trees of tasks with unequal execution times is presented. A comparison with the “critical path” heuristic is discussed.