A Combinatorial Problem Concerning Processor Interconnection Networks

  • Authors:
  • M. J. O'Donnell;C. H. Smith

  • Affiliations:
  • Department of Computer Science, Purdue University;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1982

Quantified Score

Hi-index 14.99

Visualization

Abstract

The augmented data manipulator (ADM) [5] has been proposed as an interconnection scheme for microprocessors. In this note we show how the number of permutations achieved by the last stage of an n-node ADM may be derived from a Fibonacci series. This result was used in [1] to analyze the total number of permutations achieved by an entire ADM.