Title :
Path Length Computations on Graph Models of Computations
Author :
Martin, David F. ; Estrin, Gerald
Author_Institution :
IEEE
fDate :
6/1/1969 12:00:00 AM
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 :
A priori scheduling, computer programs, graph model of computation, mean path length, parallel processing.; Combinatorial mathematics; Computational modeling; Concurrent computing; Environmental economics; Parallel processing; Performance evaluation; Power generation economics; Processor scheduling; Resource management; Throughput; A priori scheduling, computer programs, graph model of computation, mean path length, parallel processing.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1969.222705
