An efficient parallel termination detection algorithm

A. H. Baker; S. Crivelli; E. R. Jessup

doi:10.1080/00036810600595813

An efficient parallel termination detection algorithm

A. H. Baker, S. Crivelli, E. R. Jessup

Computational & Information Systems Lab

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributed-memory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routine imposes an overhead smaller than the experimental uncertainty.

Original language	English
Pages (from-to)	293-301
Number of pages	9
Journal	International Journal of Parallel, Emergent and Distributed Systems
Volume	21
Issue number	4
DOIs	https://doi.org/10.1080/00036810600595813
State	Published - Aug 1 2006

Keywords

Asynchronous termination
Distributed computing
Termination detection

Access to Document

10.1080/00036810600595813

Cite this

@article{e77abe164e164cb69f6fee7a0e07b42b,

title = "An efficient parallel termination detection algorithm",

abstract = "In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributed-memory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routine imposes an overhead smaller than the experimental uncertainty.",

keywords = "Asynchronous termination, Distributed computing, Termination detection",

author = "Baker, \{A. H.\} and S. Crivelli and Jessup, \{E. R.\}",

year = "2006",

month = aug,

day = "1",

doi = "10.1080/00036810600595813",

language = "English",

volume = "21",

pages = "293--301",

journal = "International Journal of Parallel, Emergent and Distributed Systems",

issn = "1744-5760",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - An efficient parallel termination detection algorithm

AU - Baker, A. H.

AU - Crivelli, S.

AU - Jessup, E. R.

PY - 2006/8/1

Y1 - 2006/8/1

N2 - In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributed-memory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routine imposes an overhead smaller than the experimental uncertainty.

AB - In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributed-memory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routine imposes an overhead smaller than the experimental uncertainty.

KW - Asynchronous termination

KW - Distributed computing

KW - Termination detection

UR - https://www.scopus.com/pages/publications/33745414771

U2 - 10.1080/00036810600595813

DO - 10.1080/00036810600595813

M3 - Article

AN - SCOPUS:33745414771

SN - 1744-5760

VL - 21

SP - 293

EP - 301

JO - International Journal of Parallel, Emergent and Distributed Systems

JF - International Journal of Parallel, Emergent and Distributed Systems

IS - 4

ER -

An efficient parallel termination detection algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this