DocumentCode :
1145779
Title :
A Combinatorial Problem Concerning Processor Interconnection Networks
Author :
O´Donnell, Michael J. ; Smith, Carl H.
Author_Institution :
Department of Computer Science, Purdue University
Issue :
2
fYear :
1982
Firstpage :
163
Lastpage :
164
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.
Keywords :
Augmented data manipulator; Fibonacci series; interconnection networks; Computer science; Costs; Indium tin oxide; Intelligent networks; Joining processes; Microprocessors; Multiprocessor interconnection networks; Parallel machines; Switches; Augmented data manipulator; Fibonacci series; interconnection networks;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1982.1675962
Filename :
1675962
Link To Document :
بازگشت