Issue No. 11 - November (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.177316
<p>A generalized architecture is presented for reconfigurable m-ary tree structures, where m is any integer <1. The approach is based on a generalized multistage interconnection network (MIN), which is a generalization of the augmented shuffle-exchange MIN introduce by the authors previously (1990) for obtaining reconfigurable binary tree structures. The generalized architecture with m/sup k/ processing elements or nodes (where k is any integer <1) is implemented with a k-stage MIN. A single control code issued to the MIN establishes a distinct m-ary tree configuration among the nodes. The favorable features of the architecture include fast reconfiguration, simplified hardware in the nodes and the MIN, and simple routing control. The reconfigurability of the architecture is proved, and the results of the analysis are utilized to provide a procedure to synthesize the m-ary tree configuration that is generated for any given control code. Considerations for implementing the switching elements of the MIN are discussed.</p>
generalized architecture; reconfigurable m-ary tree structures; generalized multistage interconnection network; augmented shuffle-exchange; routing control; hypercube networks; parallel architectures.
N. Biswas and S. Srinivas, "Design and Analysis of a Generalized Architecture for Reconfigurable m-ary Tree Structures," in IEEE Transactions on Computers, vol. 41, no. , pp. 1465-1478, 1992.