Abstract
This correspondence is concerned with the prevention of four types of deadlock in store-and-forward networks, i.e., progeny, copy-release, reassembly, and resequence deadlocks. The approach presented makes use of time stamping of all messages and generalizes the method of store-and-forward deadlock prevention.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have