Browse Prior Art Database

Data Buffer Mechanism

IP.com Disclosure Number: IPCOM000060785D
Original Publication Date: 1986-May-01
Included in the Prior Art Database: 2005-Mar-09

Publishing Venue

IBM

Related People

Authors:
Avery, TM Deaver, RL Goode, PK [+details]

Abstract

This article relates to data communication and more specifically to the allocation of transmit and receive buffers in a manner designed to preserve performance and prevent deadlocks. These objectives are obtained by pre-allocating buffers to a "receive" stack and a "transmit" stack and continually recalculating worst-case conditions for each sensing process as buffer requests are received. If the calculation indicates a shortage of buffers, the requesting process is denied buffer access until enough buffers are available to handle the expected worst case for that process. In devices with limited resources, the amount of space available for communication buffers can be small. Therefore, the possibility exists of being overrun with data to the extent that all of the communication buffers are being used.