Abstract
Deadlock and starvation are highly undesirable in packet switching networks. The communication processor presented in this paper was designed such that these phenomena can be proved not to occur. Deadlock is avoided using a new method called class climbing; fair usage of the classes and administration of the temporal order of arrival of the packets guarantee that no starvation can occur. The design is generally applicable in all types of networks, independent of topology or size. A planned VLSI implementation is briefly discussed.
UUCP: (seismo!)mcvax!prle1!prle2!annot);annot
UUCP:(seismo!)mcvax!prle1!prle2!twist
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.K. Annot, ”Deadlock Freedom in Packet Switching Networks”, Internal report no. 0157 of ESPRIT project 415-A, Philips Research Laboratories, Eindhoven, The Netherlands, November 1986.
H.L. Bodlaender, ”Deadlock-free packet switching networks with variable packet size”, Techn. Rep. RUU-CS-85-25, Dept. of Computer Science, University of Utrecht, Utrecht, 1985. Extended abstract in Proceedings of NGI-SION 1986 Symposium Stimulerende Informatica, pp. 475–484, Utrecht, 1986.
W.J. Dally and C.L. Seitz, ”Deadlock-Free Message Routing in Multiprocessor Interconnection Networks”, Dept. of Computer Science, California Institute of Technology, Technical Report 5206:TR:86, 1986.
W.J. Dally and C.L. Seitz, ”The Torus Routing Chip,” Distributed Computing (1986) 1: 187–196.
E.W. Dijkstra, ”Guarded Commands, Nondeterminacy and Formal Derivation of Programs”, Comm. ACM 18 (8) (1975) 453–457.
D. Gelernter, ”A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks”, IEEE Trans. Comput. (10)(1981) 709–715.
K.D. Gunther, ”Prevention of Deadlocks in Packet-Switched Data Transport Systems”, IEEE Trans. Commun. 29 (4)(1981) 512–524.
P.M. Merlin and P.J. Schweitzer, ”Deadlock Avoidance in Store-and-Forward Networks — I: Store-and-Forward Deadlock”, IEEE Trans. Commun. 28 (3) (1980) 345–354.
P.M. Merlin and P.J. Schweitzer, ”Deadlock Avoidance in Store-and-Forward Networks — II: Other Deadlock Types”, IEEE Trans. Commun. 28 (3)(1980) 355–360.
E.A.M. Odijk, ”The Philips Object-Oriented Parallel Computer”, J.V. Woods (ed.): Fifth Generation Computer Architecture (IFIP TC-10), North Holland, 1985.
R.K. Shyamasundar, ”A Simple Livelock-Free Algorithm for Packet Switching”, Science of Computer Programming 4 (1984) 249–256, North-Holland.
S. Toueg, ”Deadlock-and Livelock-Free Packet Switching Networks”, Proc. 12th ACM Symposium on Theory of Computing, Los Angeles, California, April 1980, pp. 94–99.
S. Toueg and J.D. Ullman, ”Deadlock-free Packet Switching Networks”, SIAM J. Comput. 10 (1981) 594–611.
W. Wimmer, ”Using Barrier Graphs for Deadlock Prevention in Communication Processors”, IEEE Trans. Commun. 32 (8)(1984) 897–901.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Annot, J.K., van Twist, R.A.H. (1987). A novel deadlock free and starvation free packet switching communication processor. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17943-7_121
Download citation
DOI: https://doi.org/10.1007/3-540-17943-7_121
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17943-6
Online ISBN: 978-3-540-47144-8
eBook Packages: Springer Book Archive