Paper Info
Title
A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks
Abstract
Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are arranged as a switch-based network with irregular topology, which makes routing and deadlock avoidance quite complicated. Current proposals use the up*/down* routing algorithm to remove cyclic dependencies between channels and avoid deadlock. However, routing is considerably restricted and most messages must follow non-minimal paths, increasing latency and wasting resources. ...
Year
DOI
Venue
2000
10.1007/10720115_4
CANPC
Keywords
Field
DocType
irregular networks,new methodology,computer deadlock-free routing tables,parallel computer,cost effectiveness
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Policy-based routing,Hierarchical routing,Destination-Sequenced Distance Vector routing,Routing table,Distributed computing
Conference
Volume
ISSN
ISBN
1797
0302-9743
3-540-67879-4
Citations 
PageRank 
References 
37
2.52
10
Authors
3
Name
Order
Citations
PageRank
José Carlos Sancho138229.97
Antonio Robles248130.40
José Duato33481294.85