Achieving Distributed Termination without Freezing

Abstract

An efficient algorithm for achieving distributed termination without introducing new communication channels and without delaying the basic computations (“freezing”) is presented. The algorithm is related to the methodology of designing distributed programs where the programmer is relieved from the problem of distributed termination. An informal correctness proof and complexity analysis are included. Copyright © 1982 by The Institute of Electrical and Electronics Engineers, Inc.