Accession Number:

ADA158324

Title:

Dense Trivalent Graphs for Processor Interconnection,

Descriptive Note:

Corporate Author:

WISCONSIN UNIV-MADISON

Personal Author(s):

Report Date:

1981-01-01

Pagination or Media Count:

16.0

Abstract:

In the design of a network of processors, one important consideration is the interconnection topology. A multicomputer is a collection of processing elements processor-memory complexes connected by a communications medium. The communications medium may be shared memory, a broadcast bus or ring, or a collection of point-to-point communications lines. This paper is concerned with point-to-point networks. Such a network can be modeled by an undirected simple graph in which the vertices represent processing elements and the edges represent full duplex communication lines. Additional keywords Moebius graphs Equations. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE