Advertisement

A Class of Simple Communication Patterns

  • C. S. Scholten
  • Edsger W. Dijkstra
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

We consider a finite, undirected graph each node of which contains a process. Processes contained in nodes directly connected by an edge of the graph are called each other’s neighbours.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1982

Authors and Affiliations

  • C. S. Scholten
  • Edsger W. Dijkstra

There are no affiliations available

Personalised recommendations