|
ABSTRACT
This paper presents a formal scheme for addressing base and apex nodes in SW-banyan networks. This scheme is used for routing packets in the network. Packet-switching, in conjunction with the the circuit-switch mode of operation, offers a very flexible and powerful mechanism for interprocess communication in the multiprocessor architectures based on the banyan networks. Finally, a fault-tolerent scheme for re-routing the packets in the network is presented, in case the packet encounters a faulty node in its path.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
Lipovski, G.J, Tripathi, A., "A Varistructure Array Processor", Proceedings of the Parallel Processing Conference, 1977.
|
| |
3
|
Anderesen Steinar, "Looping Algorithm Extended to Base 2t Rearrangeable Switching Networks", IEEE Tr. on Communication, October 1977, pp. 1057-1063.
|
| |
4
|
Wu, C., Feng, T., "Routing Technique for Class of Multistages Interconnection Networks", 1978 Conference on Parallel Processing, pp. 197-205.
|
| |
5
|
Lawrie, D.H., "Access and Alignment of Data in Array Processor", IEEE Transactions on Computers, vol. c-24, no.12, Dec.1975, pp.1145-1155.
|
| |
6
|
Stone, H.S., "Parallel Processing with Perfect Shuffle", IEEE Trans. on Computers, vol. c-20, pp153-161, Feb.1971.
|
| |
7
|
Benes, V.E., "Mathematical Theory of Connecting Networks and Telephone Traffic", Academic Press, 1965.
|
CITED BY 7
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Matthew C. Sejnowski , Edwin T. Upchurch , Rajan N. Kapur , Daniel P. S. Charlu , G. Jack Lipovski, An overview of the Texas reconfigurable array computer, Proceedings of the May 19-22, 1980, national computer conference, May 19-22, 1980, Anaheim, California
|
|