Natural cycletrees: Flexible interconnection graphs

Natural cycletrees, formally defined in this paper, is a subclass of Hamiltonian graphs with maximum degree 3 that contain a binary spanning tree. A natural cycletree used as an interconnection network thus supports directly broadcasting through the binary tree as well as nearest-neighbor communication through the cycle. Natural cycletrees have several other interesting properties; e.g., they are planar, easily extensible, and can be contracted using the same methods as for binary trees. The main results of the paper are: (i) Given an arbitrary basic binary spanning treeT, there exists a natural cycletree with a minimal number of edges forT. (ii) A natural cycletree has a very simple router. We give a superfast parallel algorithm that can establish near optimal router data for that router.

In  Journal of Parallel and Distributed Computing

Details

TypeArticle
URLhttp://dx.doi.org/10.1006/jpdc.1996.0023
Pages44-54
Volume33
Number1
> Publications > Natural cycletrees: Flexible interconnection graphs