Virtual Buffers for Deadlock Free Store and Forward Networks
Original Publication Date: 1978-Apr-01
Included in the Prior Art Database: 2005-Feb-20
In  a method was disclosed for implementing store-and-forward networks free of store-and-forward deadlock. We assume reader familiarity with the concepts and notation of . The schemes in [1-6] assume that real buffers are actually earmarked (reserved) to match the buffers in the virtual net (VN) and that a message fits into one real buffer. Here, we describe a way of managing virtual buffers at each node so that real buffers are not physically earmarked, and so that multi-buffer messages can be accommodated. The use of counters to manage virtual buffers also permits rapid reclassification of messages from one buffer type to another, thereby improving performance within the VN.