An axiomatic approach to code optimization for expressions
Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
One-Pass compilation of arithmetic expressions for a parallel processor
Communications of the ACM
Optimal Preemptive Scheduling on Two-Processor Systems
IEEE Transactions on Computers
Compilation Techniques for Recognition of Parallel Processable Tasks in Arithmetic Expressions
IEEE Transactions on Computers
Parallel operation in the control data 6600
AFIPS '64 (Fall, part II) Proceedings of the October 27-29, 1964, fall joint computer conference, part II: very high speed computer systems
The TI ASC: a highly modular and flexible super computer architecture
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
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
The IBM system/360 model 91: machine philosophy and instruction-handling
IBM Journal of Research and Development
Scheduling Multipipeline and Multiprocessor Computers
IEEE Transactions on Computers
| Hi-index | 14.99 |
Scheduling task trees to be executed in parallel and/or pipelined processing systems are examined under individual situations. Processor structural requirements at task nodes are also included in the model of consideration. While simple techniques can serve as heuristics, counterexamples are constructed in some crucial cases. Simple optimal algorithms are presented in two important cases: 1) unistructure, multipipe, uniform latency, and flush time; and 2) vector loops. Finally, the complexity of the remaining cases is scrutinized with different structural parameter combinations.