Cayley graphs and transputer network configuration
Authors: East, Ian R., Jassim, Sabah
The nature and use of Cayley graphs in understanding network topology design will be explained. The hypercube topology will be presented in group-theoretic form as an illustration and its isomorphism with tori, up to order four, will be shown. It will also be shown how to use the Cayley graph formulation to scalably configure a hypercube (with node process independent of identity within network). Lastly, we discuss the application of the Cayley formalism to infer and investigate new topologies which exhibit superior scaling of size and density to that of the hypercube, but which retain degree four and hence are suitable for transputer networks.
OUG-13: Real-Time Systems with Transputers, Hussein S. M. Zedan, 1990, pp 168 - 174 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.
Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org