Wormhole Routing in Parallel Computers
نویسنده
چکیده
In order to offer low communication latency and reduced buffer requirements, wormhole routing has been used in almost all new generation parallel computers. It has been a powerful switching technique where its communication latency is distance insensitive. On the other hand, deadlock avoidance is the most critical issue in wormhole networks. If deadlock handling is not considered, wormhole routers can not be used in multiprocessors. Also, performance and fault-tolerancy are two dominant issues in the design of interconnection networks of large-scale multiprocessor architectures. In this paper, only a brief review of wormhole routing issues mentioned could be made amongst the extensive published works.
منابع مشابه
Calculating Optimal Flit Size and Upper Limit on the Performance of Wormhole Routing
The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer siz...
متن کاملOn the Theory of Interconnection Networks for Parallel Computers
EEcient data transfer between processors is an essential component in any large scale parallel computation. Motivated by the growing interest in parallel computers, a signiicant amount of theoretical research has been devoted to the area of interconnection networks for parallel computers , most of it to the packet routing (or store-and-forward) model of communication. We survey some of the majo...
متن کاملA Theory of Wormhole Routing in ParallelComputersSergio
Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing: messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until its reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing ...
متن کاملA General Theory for Deadlock Avoidance in Wormhole-Routed Networks
Most machines of the last generation of distributed memory parallel computers possess speci c routers which are used to exchange messages between non-neighboring nodes in the network. Among the several technologies, wormhole routing is usually prefered because it allows low channel-setup time, and reduces the dependency between latency and inter-node distance. However, wormhole routing is very ...
متن کاملOptimal Algorithm for Matrix Transpose on Wormhole-Switched Meshes
The mesh is an architecture that has many scientific applications, and matrix transpose is an important permutation frequently performed in various techniques involving systems of linear equations. In this paper, we present an optimal algorithm for performing matrix transpose on meshes that support wormhole switching. If N is even, our algorithm takes 2 2+ N communication steps to perform matri...
متن کامل