Termination Detection for Diffusing Computations

  title={Termination Detection for Diffusing Computations},
  author={Edsger W. Dijkstra and Carel S. Scholten},
  journal={Inf. Process. Lett.},
Parallel message-passing architecture for path planning
A new parallel message-passing architecture is proposed, built upon a static packet-switching network with a fractal topology, which features an interesting property when applied to four-link processors (like transputers): it's decomposable, at any hierarchical level, in four- link modules or supernodes.
Laboratoire Bordelais de Recherche en Informatique
We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a
Describing Mobile Computations with Path Vectors
A model for diffusing computations is introduced, along with a representation for the structure of such computations, and an interesting property of path vectors is that, under reasonable assumptions, they bear sufficient knowledge to reconstruct the whole computation structure.
A superimposition algorithm for application-aware adaptation in mobile computing
A superimposition algorithm than can be employed by a substrate to change its behavior according to current conditions or properties of the mobile environment to be used by multiple local controllers that use information only from the subset of the participating mobile units.
Asynchronous distributed termination—parallel and symmetric solutions with echo algorithms
The principle of message counting is used to detect termination of distributed computations which consist of processes asynchronously communicating over non-FIFO channels, making the scheme useful for dynamic systems.
Feature-based calibration of distributed smart stereo camera networks
A novel spatial calibration method for a distributed smart camera network is presented, which obtains pose estimates suitable for collaborative 3D vision in a distributed fashion using two stages of registration on robust 3D features.
Loop-free routing using diffusing computations
A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or Memet is presented, validated, and analyzed and is shown to converge in finite time after an arbitrary sequence of link coat or topological changes.
Au/OmGnCG. Vol 27. No I. pp 3--21.1991 PrInted In Great Bnta,n
This work considers synchronous executions of iterative algorithms of the form x:= f(x), executed by a parallel or distributed computing svstem and classify asynchronous algorithms into three main categories depending on the amount of asynchronism they can tolerate.
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