Premium
Minimal deadlock‐free store‐and‐forward communication networks
Author(s) -
Bongiovanni G.,
Bovet D. P.
Publication year - 1987
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230170205
Subject(s) - deadlock , computer science , store and forward , distributed computing , buffer (optical fiber) , deadlock prevention algorithms , computer network , graph , parallel computing , theoretical computer science , telecommunications
Store‐and‐forward communication networks may be designed so as to be free from store‐and‐forward deadlock. This is accomplished by incorporating in the network an acyclic buffer graph on which messages are forwarded, from buffer to buffer, according to all the desired routes. A technique producing minimum buffer graphs for a rather large class of networks is illustrated. Successively, a comparison is made with other well‐known deadlock avoidance techniques, showing that substantial savings can be achieved.