By Topic

Pin-efficient networks for cubic neighborhoods

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
$31 $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

2 Author(s)
Fiduccia, Charles M. ; Supercomputing Res. Center, Bowie, MD, USA ; Rappoport, K.J.

Pin-efficient bussed network families are discussed that can-in one clock tick-simultaneously shift all data in a k-dimensional grid to neighboring processors in any one of the 3k-1 `compass directions' x&oarr;→x&oarr;+δ&oarr;, for every nonzero vector δ&oarr; ∈ {-1,0,1}k. The networks have the advantages of being simple to describe (using a single 5-state automaton), extendible (the k-dimensional network is obtained by extending the busses of the (k-1)-dimensional network), and provably optimal for k⩽3. The networks use only [3/2(√3)k] pins per processor, which is within 3/2 of the theoretical minimum number of pins required. The best previously known family uses 2k pins

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994