The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—A number of low degree and, thus, low complexity, Cayley-graph interconnection structures, such as honeycomb and diamond networks, are known to be derivable by systematic pruning of 2D or 3D tori. In this paper, we extend these known pruning schemes via a general algebraic construction based on commutative groups. We show that, under certain conditions, Cayley graphs based on the constructed groups are pruned networks when Cayley graphs of the original commutative groups are <tmath>k{\rm D}</tmath> tori. Thus, our results offer a general mathematical framework for synthesizing and exploring pruned interconnection networks that offer lower node degrees and, thus, smaller VLSI layout and simpler physical packaging. Our constructions also lead to new insights, as well as new concrete results, for previously known interconnection schemes such as honeycomb and diamond networks.</p>
Algebraic structure, Cayley graph, distributed system, geometric group theory, interconnection network, network diameter, parallel processor architecture, pruning scheme, VLSI realization.

W. Xiao and B. Parhami, "A Group Construction Method with Applications to Deriving Pruned Interconnection Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 637-643, 2007.
83 ms
(Ver 3.3 (11022016))