A METHOD OF TERMINATING ASYNCHRONOUS ITERATIVE ALGORITHMS ON MESSAGE PASSING SYSTEMS

References

• C. Hazary and H. Zedan , A distributed algorithm for distributed termination , Information Processing Letters 24 ( 1987 ), 293 – 297 .
   Web of Science ®Google Scholar
• F. Mattern , Algorithms for distributed termination detection , Distrwibuted Computation 2 ( 1987 ), 161 – 175 .
   Web of Science ®Google Scholar
• R. W. Topor , Termination detection for distributed computation , Inform. Process. Lett. 18 ( 1984 ), 33 – 36 .
   Web of Science ®Google Scholar
• D. P. Bertsekas , Distributed asynchronous computation of fixed points , Mathematical Programming 27 ( 1983 ), 107 – 120 .
   Web of Science ®Google Scholar
• D. P. Bertsekas and J. Tsilsiklis Parallel and Distributed Computation, Numerical Methods , Prentice Hall , Englewood Cliffs , NJ , 1989 .
   Google Scholar
• G. M. Baudet , Asynchronous iterative methods for multiprocessors , J. Assoc. Comput. Mach. 2 ( 1978 ), 226 – 244 .
   Google Scholar
• D. Chazan and W. Miranker , Chaotic relaxation , Linear Algebra Appl. 2 ( 1969 ), 199 – 222 .
   Google Scholar
• J. C. Miellou , Algorithmes de relaxation chaotique à retards , RAIRO R1 ( 1975 ), 55 – 82 .
   Google Scholar
• D. P. Bertsekas , D. El Baz , Distributed asynchronous relaxation methods for convex network flow problems , SIAM J. on Control and Optimization 25 ( 1987 ), 74 – 85 .
   Web of Science ®Google Scholar
• D. El Baz , M-functions, and parallel asynchronous algorithms , SIAM Journal on Numerical Analysis 27 ( 1990 ), 136 – 140 .
   Web of Science ®Google Scholar
• D. J. Evans and W. Deren , An asynchronous parallel algorithm for solving a class of nonlinear simultaneous equations , Parallel Computing 17 ( 1991 ), 165 – 180 .
   Web of Science ®Google Scholar
• D. El Baz , Asynchronous gradient algorithms for a class of convex separable network flow problems , to appear in Computational Optimization and Applications .
   Google Scholar
• B. Lubachevsky and D. Mitra A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius , J.A.C.M. 33 ( 1986 ), 130 – 150 .
   Google Scholar
• J. C. Miellou Itérations chaotiques à retards, étude de la convergence dans le cas d'espaees partiellement ordonnés , C.R.A.S. Paris 280 ( 1975 ), 233 – 236 .
   Google Scholar
• J. C. Miellou Asynchronous iterations and order intervals , in Parallel Algorithms and Architectures , M. Cosnard , ed., North Holland , 1986 , 85 – 96 .
   Google Scholar
• J. C. Miellou and P. Spiteri , Un critère de convergence pour des méthodes générales de point fixe , R.A.I.R.O. M2AN 19 ( 1985 ), 645 – 669 .
   Google Scholar
• D. P. Bertsckas and J. Tsitsiklis Some aspects of parallel and distributed iterative algorithms . A survey, Automatica 27 ( 1991 ), 3 – 21 .
   Web of Science ®Google Scholar
• E. W. Dijkstra and C. S. Scholten , Termination detection for diffusing computation , Information Processing Letters 11 ( 1980 ), 1 – 4 .
   Web of Science ®Google Scholar
• K. M. Chandy and L. Lamport , Distributed snapshots: Determining global state of distributed systems , ACM Trans. on Computer Systems 3 ( 1985 ), 63 – 75 .
   Web of Science ®Google Scholar
• S. A. Savari and D. P. Bertsekas , Finite termination of asynchronous iterative algorithms , LIDS Report P-2245 , M.I.T. , 1994 .
   Google Scholar