Finite termination of asynchronous iterative algorithms

Parallel Computing

Volumn 22, Issue 1, 1996, Pages 39-56

  Savari, S A ^a   Bertsekas, D P ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asynchronous iterative methods; Distributed memory multiprocessor; Linear algebra; Message passing system; Termination detection

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; LINEAR ALGEBRA; MULTIPROCESSING SYSTEMS;

ASYNCHRONOUS ITERATIVE ALGORITHMS; DISTRIBUTED MEMORY MULTIPROCESSOR; MESSAGE PASSING SYSTEM; TERMINATION DETECTION;

ITERATIVE METHODS;

EID: 0029736203     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(95)00059-3     Document Type: Article

References (15)

1. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, NJ, 1989).
2. D.P. Bertsekas and J.N. Tsitsiklis, Some aspects of parallel and distributed algorithms - a survey, Automatica 27 (1) (1991) 3-21.
3. E.W. Dijkstra and C.S. Scholten, Termination detection for diffusing computations, Inform. Process. Lett. 11 (1980) 1-4.
4. N. Francez, Distributed termination, ACM Trans. Programming Languages Syst. 2 (1) (Jan. 1980) 42-55.
5. N. Francez and M. Rodeh, Achieving distributed termination without freezing, IEEE Trans. Software Eng. SE-8 (May 1982) 287-292.
6. E.W. Dijkstra, W.H.J. Feijen and A.J.M. van Gasteren, Derivation of a termination algorithm for distributed computations, Inform. Process. Lett. 16 (1983) 217-219.
7. R.W. Topor, Termination detection for distributed computations, Inform. Process. Lett. 18 (1984) 33-36.
8. K.M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Trans. Comput. Syst. 3 (1985) 63-75.
9. D. Kumar, A class of termination detection algorithms for distributed computations, Proc. Fifth Conf. Foundations Software Technol. & Theoret. Comput. Sci., New Delhi, India (Dec. 16-18, 1985) Lecture Notes in Computer Science, 206 (Berlin, Germany, Springer-Verlag) 73-100.
10. D. Kumar, Development of a class of distributed termination detection algorithms, IEEE Trans. Knowledge and Data Eng. 4 (2) (Apr. 1992).
11. D.P. Bertsekas and J.N. Tsitsiklis, Convergence rate and termination of asynchronous iterative algorithms, Proc. 1989 Int. Conf. on Supercomputing, Irakleion, Crete (1989) 461-470.
12. D. Chazan and W.L. Miranker, Chaotic relaxation, Lin. Algebra and Appl. 2 (1969) 199-222.
13. G.M. Baudet, Asynchronous iterative methods for multiprocessors, J. ACM 15 (1978) 226-244.
14. D.P. Bertsekas and R.G. Gallager, Data Networks (Prentice-Hall, NJ, 1987).
15. R.G. Gallager, P.A. Humblet and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans. Programming Languages Syst. 5 (1) (Jan. 1983) 66-77.