Performance analysis of mesh interconnection networks with deterministic routing
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing
− This paper develops detailed analytical performance models for k-ary n-cube networks with single-flit or infinite buffers, wormhole routing, and the non-adaptive deadlock-free routing scheme proposed by Dally and Seitz. In contrast to previous performance studies of such networks, the system is modeled as a closed queueing network that (1) includes the effects of blocking and pipelining of me...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
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 ne...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
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 ne...
متن کاملPerformance Analysis of Multiprocessor Mesh Interconnection Networks with Wormhole Routing
In this paper, we develop a fairly precise performance model for k-ary n-cube networks with single-flit or infinite buffers, and wormhole routing. The models include the deadlock-free routing scheme of Dally and Seitz in the finite-buffer case. In contrast to previous work, we model the system as a closed queueing network and (i) we include the effects of blocking and pipelining of messages in ...
متن کاملA New Approach to Fault-Tolerant Routing in Mesh Interconnection Networks, Based on Deterministic Routing
Many of the calculating systems are made based on a parallel nodes architecture. In these systems, interconnection networks play a main role. Because the number of nodes is thousands, the probability of failure is high. So, developing fault-tolerant mechanisms is essential. In this paper a new fault-tolerant routing algorithm, which is based on deterministic methods, is introduced for a two dim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1994
ISSN: 1045-9219
DOI: 10.1109/71.277793