By Topic

Implementation of Permutation Functions in Illiac IV-Type Computers

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)
S. E. Orcutt ; Bell Laboratories

Much research has recently been done on processor interconnection schemes for parallel computers. These interconnection schemes allow certain permutations to be performed in less than linear time, typically 0(log N), 0(log2N), or 0(√N) for a vector of N elements and N processors. In this paper we show that many permutations can also be performed in less than linear time on a machine with an Illiac IV-type interconnection scheme, that is connections to processors at distances of ± 1 and ±√N. These reselts show that, for irregular permutations, these recently developed interconnection schemes yield a speedup of at most 0(√N) over the Illiac IV-type interconnections. These results are of current interest due to the present Illiac IV programming effort.

Published in:

IEEE Transactions on Computers  (Volume:C-25 ,  Issue: 9 )