2.4.1LPM /96 In the longest path matrix algorithm(LPM),series of matrices is constructed,the iteration bound is found by examining the diagonal elements of the matrices. L(m),m=1,2,..,d,are constructed such that value of the element I(m)is the longest computation time of all paths from delay element d to delay element d;that pass through exactly m-1 delays. If no such path exists,the I(m=-1. m Delay=m-1 (m) 72 1(m) Lm）= Longest Computation time 14 ad From i to j 2021年2月 82021年2月 8 2.4.1 LPM  In the longest path matrix algorithm (LPM), series of matrices is constructed, the iteration bound is found by examining the diagonal elements of the matrices.  L (m), m=1,2,..,d, are constructed such that value of the element l (m) i,j is the longest computation time of all paths from delay element di to delay element dj that pass through exactly m-1 delays.  If no such path exists, the l(m) i,j=-1. ( ) ( ) ( ) 11 12 1 ( ) ( ) ( ) ( ) 21 22 2 ( ) ( ) ( ) 1 2 ... ... ... ... m m m d m m m m d m m m d d dd l l l l l l L l l l                Delay=m-1 From i to j Longest Computation time