Advertisement

Distributed Computation of a Spanning Tree

  • W. H. J. Feijen
  • A. J. M. van Gasteren
Part of the Monographs in Computer Science book series (MCS)

Abstract

A typical architecture that one encounters is that of a number of computers located in the nodes of a sparsely connected, but otherwise arbitrary network. One of the difficulties with such an architecture is that the flow of control and the information exchange between the various computers are not always easily orchestrated, simply because the network is so arbitrary. This brings about the so-called routing problem. There are, however, at least two general ways to reduce these difficulties.

Keywords

Metaphor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • W. H. J. Feijen
    • 1
  • A. J. M. van Gasteren
    • 1
  1. 1.Department of Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations