We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING.
- Authors
Wu, Jie; Sheng, Li
- Abstract
We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.
- Subjects
NETWORK routers; COMPUTER networks; INTERNETWORKING devices; TREE graphs; SPAN (Electronic computer system); GROUP extensions (Mathematics)
- Publication
Parallel Processing Letters, 2003, Vol 13, Issue 4, p705
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626403001616