A distributed solution of the distributed termination problem

Rana, S.P.

doi:10.1016/0020-0190(83)90089-3

Cited by 78 publications

(30 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithms in this area can be broadly classified as "symmetric" and "asymmetric" algorithms. In the symmetric algorithms [9,12,14,24,26] all the processes execute identical code and any process can detect the termination. The asymmetric algorithms [7,8,11,17,20,22,29] rely on a pre-designated process for termination detection.…”

Section: Other Workmentioning

confidence: 99%

“…Termination detection algorithms may also be divided into three classes depending upon the topology employed for the control communication, viz. Hamiltonian cycle [8,24,26], spanning tree [2,5,10,11,17,19,20,29] and general networks [7,9,12,14,15,21,22,27].…”

Section: Other Workmentioning

confidence: 99%

“…The algorithms of [12,14,17,24] assume the existence of local clocks. These algorithms incur the overheads of synchronizing the local clocks using messages containing time-stamps [18].…”

Section: Other Workmentioning

confidence: 99%

“…These algorithms incur the overheads of synchronizing the local clocks using messages containing time-stamps [18]. The algorithms of [9,24,26] assume global information in terms of either the diameter of the network or the number of processes. In [16,17,20], the processes use the technique of message counting.…”

Section: Other Workmentioning

confidence: 99%

See 3 more Smart Citations

Distributed termination detection for dynamic systems

1997

View full text Add to dashboard Cite

A symmetric algorithm for detecting the termination of a distributed computation is presented. The algorithm does not require global information concerning the system and does not assume any communication features barring finite delays in the delivery of messages. It permits dynamic creation and destruction of processes participating in the computation. It provides for destruction of a process by external processes, such as the OS kernel. It also provides for external processes spontaneously joining an ongoing computation. Proofs of safety and liveness are provided.

show abstract

Section: Other Workmentioning

confidence: 99%

Section: Other Workmentioning

confidence: 99%

“…The algorithms of [12,14,17,24] assume the existence of local clocks. These algorithms incur the overheads of synchronizing the local clocks using messages containing time-stamps [18].…”

Section: Other Workmentioning

confidence: 99%

Section: Other Workmentioning

confidence: 99%

See 2 more Smart Citations

Distributed termination detection for dynamic systems

1997

View full text Add to dashboard Cite

show abstract

“…See, for example, [1,2,5,6,7,9,10,8,12,13,14]. Of these, the algorithm presented by Sinha, Kale, and Ramkumar [13] (henceforth, the SKR algorithm) is unique in its ability to adapt to the load conditions of the system on which it runs, thereby minimizing the impact of termination detection on performance.…”

Section: Introductionmentioning

confidence: 99%

An efficient parallel termination detection algorithm

Baker

Crivelli

Jessup

2006

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

Design and Analysis of Distributed Algorithms

Santoro¹

2006

158

147

View full text Add to dashboard Cite

Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages.For general information on our other products and services or for technical support, please contact our Customer Care Department within the United States at (800) 762-2974, outside the United States at (317) 572-3993 or fax (317) 572-4002.Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic formats. For more information about Wiley products, visit our web site at www.wiley.com.

show abstract

A distributed solution of the distributed termination problem

Cited by 78 publications

References 2 publications

Distributed termination detection for dynamic systems

Distributed termination detection for dynamic systems

An efficient parallel termination detection algorithm

Design and Analysis of Distributed Algorithms

Contact Info

Product

Resources

About