The Community for Technology Leaders
Green Image
ABSTRACT
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.
INDEX TERMS
A priori scheduling, computer programs, graph model of computation, mean path length, parallel processing.
CITATION
D.F. Martin, G. Estrin, "Path Length Computations on Graph Models of Computations", IEEE Transactions on Computers, vol. 18, no. , pp. 530-536, June 1969, doi:10.1109/T-C.1969.222705
90 ms
(Ver )