A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
Journal of the ACM (JACM)
MIMD machine communication using the augmented data manipulator network
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Determining an Optimal Secondary Storage Service Rate for the PASM Control System
IEEE Transactions on Computers
On the Augmented Data Manipulator Network in SIMD Environments
IEEE Transactions on Computers
The Kappa Network with Fault-Tolerant Destination Tag Algorithm
IEEE Transactions on Computers
Realizing Fault-Tolerant Interconnection Networks Via Chaining
IEEE Transactions on Computers - Fault-Tolerant Computing
Extra group network: a cost-effective fault-tolerant multistage interconnection network
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Destination tag routing techniques based on a state model for the LADM network
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
Performance analysis of multipath multistage interconnection networks
SIGMETRICS '88 Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Resource Sharing Interconnection Networks in Multiprocessors
IEEE Transactions on Computers
Multistage Interconnection Network Reliability
IEEE Transactions on Computers
Failure Dependent Performance Analysis of a Fault-Tolerant Multistage Interconnection Network
IEEE Transactions on Computers
A cost-effective reliable multipath interconnection network
ACM SIGARCH Computer Architecture News
Destination Tag Routing Techniques Based on a State Model for the IADM Network
IEEE Transactions on Computers
On performance evaluation of fault tolerant multistage interconnection networks
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
A fault-tolerant scheme for multistage interconnection networks
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Design and analysis of fault-tolerant multistage interconnection networks with low link complexity
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
IEEE Transactions on Computers
Task Preloading Schemes for Reconfigurable Parallel Processing Systems
IEEE Transactions on Computers
A Class of Redundant Path Multistage Interconnection Networks
IEEE Transactions on Computers
Shuffling with the Illiac and PM2I SIMD Networks
IEEE Transactions on Computers
| Hi-index | 0.03 |
The Gamma network is an interconnection network connecting N&equil;2" inputs to N outputs. It consists of log2N stages with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via “power of two” and identity connections in such a way that redundant paths exist between the input and output terminals. In this network, a path from a source to a destination may be represented using one of the redundant forms of the difference between the source and destination numbers. The redundancy in paths may thus be studied using the theory of redundant number systems. Results are obtained on the distribution of paths connecting inputs to outputs, and the permuting capabilities of the Gamma network. Switch settings for certain frequently used permutations and control mechanisms are also considered in this paper. This network has an interesting application in solving tridiagonal systems using the odd-even elimination algorithm.