Adaptive Deadlock-Free Packet Routeing in Transputer-Based Multiprocessor Interconnection Networks

Open Access
Publisher Website
Google Scholar
Abstract
This paper presents a deadlock-free routeing algorithm for multiprocessor interconnection networks based on store-and-forward (S/F) communication. The adaptive nature of the method proposed encourages using light traffic paths. Furthermore it has the properties of avoiding blocked communication (deadlock), reducing communication delay time between source and destination, using efficiently message buffers as network resources and being able to control communication traffic flow from each processor of the network. The routeing algorithm has been implemented on a 64-node transputer network (T-Rack) configured as a number of well known topologies to evaluate the behaviour of the algorithm and some performance figures have been derived.

This publication has 0 references indexed in Scilit: