English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Contrary to the sequential world, the processes involved in a distributedsystem do not necessarily know when a computation is globally finished. Thispaper investigates the problem of the detection of the termination of localcomputations. We define four types of termination detection: no detection,detection of the local termination, detection by a distributed observer,detection of the global termination. We give a complete characterisation(except in the local termination detection case where a partial one is given)for each of this termination detection and show that they define a stricthierarchy. These results emphasise the difference between computability of adistributed task and termination detection. Furthermore, thesecharacterisations encompass all standard criteria that are usually formulated :topological restriction (tree, rings, or triangu- lated networks ...),topological knowledge (size, diameter ...), and local knowledge to distinguishnodes (identities, sense of direction). These results are now presented ascorollaries of generalising theorems. As a very special and important case, thetechniques are also applied to the election problem. Though given in the modelof local computations, these results can give qualitative insight for similarresults in other standard models. The necessary conditions involve graphscovering and quasi-covering; the sufficient conditions (constructive localcomputations) are based upon an enumeration algorithm of Mazurkiewicz and astable properties detection algorithm of Szymanski, Shi and Prywes.

Termination Detection of Local Computations