The Performance Analysis of Three Routing Algorithms of General Shuffle-exchange Networks
碩士 === 國立交通大學 === 應用數學系所 === 96 === The shuffle-exchange network is a popular architecture for multistage interconnection networks. The number of nodes in a shuffle-exchange network is usually a power of k if each switching element in the network is of size kxk. In [10] Padmanbhan relaxed the restri...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/5e6z36 |