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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bodlaender HL (1986) Distributed computing. Ph.D. Thesis, Utrecht (November 1986) pp 101–122
Cidon I, Jaffe JM, Sidi M (1987) Local distributed deadlock detection by cycle detection and clustering. IEEE Trans Softw Eng 13:3–14
Dally WJ, Seitz CL (1986a) Deadlock free message routing in multiprocessor interconnections networks. Tech Rep 5206:TR:86. Dept Comput Sci, California Institute of Technology
Dally WJ, Seitz CL (1986b) The torus routing chip. Distrib Comput 1:187–196
Dijkstra WE, Scholten CS (1982) Lect Notes “Predicate Transformers” (draft), EWD 835 (November 1982) pp 12
Günther KD (1981) Prevention of deadlocks in packet-switched data transport systems. IEEE Trans Commun 4:512–524
Kermani P, Kleinrock L (1979) Virtual cut-through: a new computer communication switching technique. Comput Networks 3:267–286
Kleinrock L (1976) Queuing systems, vol 2. Wiley, New York, pp 422–427 and 438–446
Lang CR Jr (1982) The extension of object-oriented languages to a homogeneous concurrent architecture. Tech Rep 5014:TR:82. Dept Comput Sci, California Institute of Technology
Merlin PM, Schweitzer PJ (1980) Deadlock avoidance in store-and-forward networks-I: store-and-forward deadlock. IEEE Trans Commun 3:345–354
Author information
Authors and Affiliations
Additional information
Peter A.J. Hilbers received the B.S. and M.S. degrees in mathematics, and the Ph.D. degree in computer science from Groningen University, Groningen, The Netherlands, in 1979, 1983, and 1989, respectively. From 1988 to 1989 he was an Assistant Professor with the Department of Computing Science at Groningen University. Currently he is a research engineer in the Department of Mathematics and Systems Engineering at the Koninklijke/Shell-Laboratorium, Amsterdam (Shell Research B.V.). His research intersts are program derivation and correctness, concurrency, and processor networks.
Johan J. Lukkien received the B.S. and M.S. degrees in mathematics from Groningen University, Groningen, The Netherlands in 1982 and 1986 respectively. Currently he is a Ph.D. student at the Department of Computing Science, Groningen University. His research area is the construction and verification of concurrent programs.
Rights and permissions
About this article
Cite this article
Hilbers, P.A.J., Lukkien, J.J. Deadlock-free message routing in multicomputer networks. Distrib Comput 3, 178–186 (1989). https://doi.org/10.1007/BF01784886
Issue Date:
DOI: https://doi.org/10.1007/BF01784886