Distributed termination on a hypercube

A distributed termination detection algorithm, based on token-passing, is proposed for hypercube algorithms, by exploiting some of the properties inherent in such machines. The algorithm is fully distributed and symmetric in the sense that every processing element has an identical protocol and any processing element can detect termination. The algorithm naturally fits the physical structure of hypercube machines. The proposed algorithm is applicable to any asynchronous iterative computation and does not assume instantaneous message transmission. No global transmission of messages is needed to detect the termination. The algorithm is also applicable to multitasking environments.<>