Journal of the ACM (JACM)
Graph models of computations in computer systems
Graph models of computations in computer systems
Volume i. the automatic assignment and sequencing of computations on parallel processor systems. volume ii. program listings
R68-5 Models of Computational Systems-Cyclic to Acyclic Graph Transformations
IEEE Transactions on Computers
Path Length Computations on Graph Models of Computations
IEEE Transactions on Computers
Measurement based automatic analysis of FORTRAN programs
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
A Dynamic Memory Allocation Algorithm
IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules
IEEE Transactions on Computers
| Hi-index | 15.00 |
Given an acyclic directed graph where vertices represent computational tasks, arcs represent transfer of control, and two labels called input and output logics associated with each vertex show either the concurrency or the mutual exclusiveness of tasks, procedures are given to determine a lower and an upper bound on the number of processors required for maximum parallelism. The lower bound is obtained via a mean path length approach, while the upper bound is based on the structure of the graph. A detailed algorithm is given for the latter. First, some reduction rules are applied yielding a subset of the vertices which can be performed in parallel. Then the maximum cut in the graph is determined taking into account mutually exclusive vertices. Results are given for example graphs.