Paper Info
Title
Deadlock-Free Message Routing in Multicomputer Networks.
Abstract
The execution of a concurrent computation by a network of processors requires a routing algorithm that is deadlock free. Many routing algorithms proposed for processor networks have the potential of deadlock due to the cyclic topology of the network. In this paper we first formalize the concept of message routing. Next, we show a method by which a deadlock-free routing algorithm can be constructed out of a given routing algorithm. Finally the method is illustrated by constructing deadlock-free routing algorithms for cartesian product processor networks.
Year
DOI
Venue
1989
10.1007/BF01784886
Distributed computing
Keywords
Field
DocType
Processor network,Routing algorithm,Deadlock freeness-Cartesian product,Cutthrough routing
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Policy-based routing,Computer science,Static routing,Parallel computing,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Geographic routing
Journal
Volume
Issue
ISSN
3
4
1432-0452
Citations 
PageRank 
References 
7
1.26
4
Authors
2
Name
Order
Citations
PageRank
Peter A. J. Hilbers110012.73
Johan J. Lukkien267170.50