By Topic

Bussed interconnection networks from trees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. M. Fiduccia ; Supercomputing Res. Center, Bowie, MD, USA

Pin limitations are a fundamental obstacle in the construction of massively parallel computers. The paper introduces a class of d-dimensional bussed hypercubes that can perform simultaneous bidirectional communication across any dimension using d+1, rather than 2d, ports per node. Each network Qd (T) is based on a tree T, which specifies the 'shape' of the busses, and can perform d(d+1)/2 permutations πij(x)=xc ij via a simple global command. This construction is then generalized to any d permutations II=(π1,. . .,πd) of any set of nodes X. Given any edge-labeled directed tree T, whose kth arc is associated with the permutation πk, a bussed network N (II,T) is constructed that can-in one clock tick-perform any of the O(d2) permutations arising from the paths in the tree T

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992