An algorithm is presented to solve the problem of run-time parallel loop identification based on distributed system for the loops in irregular programs, from which inspective loops can be extracted. The contributions are: (1) The algorithm is fully parallel and can be run on a distributed system; (2) Loops with copy-in and last assignment attributes can be directly analyzed; (3) A method is given for a loop to parallel; (4) Some partial parallel loop can also be parallelized. The theoretical analysis and experimental results show that in adequate number of processors,if a loop is paralle,a good speedup can be obtained;if loop is not parallel,the slowdown of serial executing is small.A new method is given for exploiting more loop paralizations on the distributed system