An efficient parallel termination detection algorithm

International Journal of Parallel, Emergent and Distributed Systems

Volumn 21, Issue 4, 2006, Pages 293-301

  Baker, A H ^a   Crivelli, S ^b   Jessup, E R ^c  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c University of Colorado at Boulder   (United States)

Author keywords

Asynchronous termination; Distributed computing; Termination detection

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS TERMINATION; DISTRIBUTED COMPUTING; TERMINATION DETECTION;

PARALLEL PROCESSING SYSTEMS;

EID: 33745414771     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/00036810600595813     Document Type: Article

References (14)

1. Chandrasekaran, S. and Venkatesan, S., 1990, A message-optimal algorithm for distributed termination detection, Journal of Parallel and Distributed Computing, 8, 245-252.
2. Chandy, M. and Misra, J., 1986, An example of stepwise refinement of distributed programs: quiescence detection, ACM Transactions on Programming Languages and Systems, 8(3), 326-343.
3. Crivelli, S., 1995, A programming paradigm and library for distributed-memory computers, PhD thesis, Dept. of Computer Science, University of Colorado at Boulder.
4. Crivelli, S. and Jessup, E.R., 1999, The PMESC programming library for distributed-memory MIMD computers, Journal of Parallel and Distributed Computing, 57, 295-321.
5. Dijkstra, E.W. and Scholten, C.S., 1980, Termination detection for diffusing computations, Information Processing Letters, 11(1), 1-4.
6. Filali, M., Mauran, P., Padiou, G., Queinnec, P. and Thirioux, X., 2000, Refinement-based validation of an algorithm for detecting distributed termination, Lecture Notes in Computer Science, 1800, 1027-1036.
7. Mahapatra, N. and Dutt, S., An efficient delay-optimal distributed termination detection algorithm, Technical Report 2001-16, Department of Computer Science and Engineering, University at Buffalo, 2001.
8. Matocha, J. and Camp, T., 1998, A taxonomy of distributed termination detection algorithms, The Journal of Systems and Software, 43, 207-221.
9. Mattern, F., 1989, Global quiescence detection based on credit distribution and recovery, Information Processing Letters, 30, 195-200.
10. Mattern, F., 1993, Efficient algorithms for distributed snapshots and global virtual time approximation, Journal of Parallel and Distributed Computing, 18, 423-434.
11. Message Passing Interface Forum, 1998, MPI2: A message passing interface standard, High Performance Computing Applications, 12(1/2), 1-299.
12. Rana, S.P., 1983, A distributed solution of the distributed termination problem, Information Processing Letters, 17, 43-46.
13. Sinha, A., Kale, L.V. and Ramkumar, B., 1993, A dynamic and adaptive quiescence detection algorithm, Technical Report 93-11, Parallel Programming Laboratory, Department of Computer Science, University of Illinois at Urbana-Champaign.
14. Tel, G. and Mattern, F., 1993, The derivation of distributed termination detection algorithms from garbage collection schemes, ACM Transactions on Programming Languages and Systems, 15(1), 1-35.