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

Nguyễn Trường Sơn | Zendy; Yakup Paker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Nguyễn Trường Sơn,

Yakup Paker

Publication year - 1991

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/34.6.493

Subject(s) - transputer , computer science , deadlock , multiprocessing , interconnection , network packet , parallel computing , node (physics) , computer network , network topology , distributed computing , hypercube , telecommunications network , engineering , structural engineering

This paper presents a deadlock-free routeing algorithm for multiprocessor interconnection networks based on store-andforward (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 64node 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research