Issue No. 06 - June (1969 vol. 18)
D.F. Martin , IEEE
This paper discusses essential difficulties in calculating mean path lengths on a directed graph model of computations. This study was part of a larger study of a priori scheduling of computer programs in a parallel processing environment. Efficient approximations to mean processing time (mean path length) of programs in such an environment are given.
A priori scheduling, computer programs, graph model of computation, mean path length, parallel processing.
D. Martin and G. Estrin, "Path Length Computations on Graph Models of Computations," in IEEE Transactions on Computers, vol. 18, no. , pp. 530-536, 1969.