Path Length Computations on Graph Models of Computations
- 1 June 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-18 (6) , 530-536
- https://doi.org/10.1109/t-c.1969.222705
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.Keywords
This publication has 0 references indexed in Scilit: