Volume 20, Issue 2 (4-2001)
2001, 20(2): 17-25 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
S.Samavi, V. Tahani and P. Khadivi. Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks. Computational Methods in Engineering 2001; 20 (2) :17-25
URL: http://jcme.iut.ac.ir/article-1-225-en.html
URL: http://jcme.iut.ac.ir/article-1-225-en.html
Abstract: (3941 Views)
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural network and its energy function is introduced. This network requires a significantly smaller number of neurons compared to its counterparts. Also presented is the performance of this neural network.
Keywords: Routing, Multicomputer systems, Recurrent neural networks, Mesh interconnection networks.
