University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Bandwidth management in interconnection networks for multiprocessor architecture.

Baker, Nayef. (2003) Bandwidth management in interconnection networks for multiprocessor architecture. Doctoral thesis, University of Surrey (United Kingdom)..

Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (18MB) | Preview


This thesis explores issues related to the routing of messages in a k - aryn - cube multiprocessor interconnection network. By using a distributed algorithm that identifies paths for particular inter-processor communication flows, the capacities of the interconnecting links can be shared in a predictable manner, blocking and congestion can be reduced, and hot-spots avoided. The paths that are identified are not necessarily the shortest ones possible. The nodes in the routing fabric are autonomous - i.e. they respond to incoming messages independently and each maintains its own routing table. The thesis describes the bandwidth reservation algorithm in detail and proposes an implementation which is then simulated with a clock resolution of one cycle per unit of data communicated. The livelock and deadlock-freedom of the implementation is justified. Simulation measurements demonstrate that the set-up, communication and close-down performance of each path is as expected, that the algorithm performs correctly under various traffic models, and that the technique compares favourably with a Minimal Adaptive Routing scheme under certain conditions.

Item Type: Thesis (Doctoral)
Divisions : Theses
Authors :
Date : 2003
Contributors :
Depositing User : EPrints Services
Date Deposited : 09 Nov 2017 12:13
Last Modified : 15 Mar 2018 23:57

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800