Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
1996-08-14
2001-01-30
Ngo, Ricky (Department: 2731)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S429000, C711S171000
Reexamination Certificate
active
06181705
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Technical Field
The invention relates to distributed data processing systems and more particularly to management of a buffer for a network adaptor receiving and/or transmitting data packets for a node of a distributed data processing system.
2. Description of the Related Art
The passing of data between a communications link and a node comprising a computer or terminal is commonly supported by buffering the data. The object of buffering is to avoid rigid synchronization in operation of the communications link and the internal operations of the node. A buffer may be implemented using memory or data storage registers, a disk drive, a delay line, or any one of a number of technologies. Use of a buffer allows for differences in the rate of flow of information or time of occurrence of events when transmitting information between the communications link and node.
The organization of data for transmission over a communications link has a number of consequences relating to efficient use of the communications link, management of transmission and receipt of the data, efficient use of memory upon receipt of the data, among other things. For example, a common way of handling organization of data is the use of packets, in which control and data elements are switched and transmitted as a composite whole. The use of packets simplifies a number of issues concerning routing.
Packets, or other types of data frames, may be variable in length. This has an advantage over fixed length frames in terms of efficient utilization of a communications link throughput capacity. The allocation of space in a buffer for the creation, transmission, copying and manipulation of variable length frames can, however, consume a considerable portion of the processing power of a node if the task is implemented in sequential software. The computation and construction of direct memory access (DMA) control blocks is a major part of the problem.
One way to reduce the computational load imposed on a receiving node by the use of variable length frames is to receive the frames into buffer locations of fixed length, which allow for any possible size of frame, including headers which may be added to the frame after the bulk data copy. A problem with this approach is that requires use of a great deal of memory to implement because of internal fragmentation of the buffer.
Buffer location chaining has also been used as an approach to the problem. However, doing so requires construction of descriptions of the chains and the need to allocate memory bandwidth for the reading of the chains.
Also known is the use of a first-in, first-out (FIFO) receive buffer where only so much location as is needed for a packet/frame is used. This approach suffers from the complication of a need for clearing memory. When a memory location is released, all of the frames preceding the released frame in time must also be released before the particular location may be reused.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide a system and method for the management of a buffer for a network adaptor receiving data packets for a node in a distributed data processing system.
It is another object of the present invention to provide for a system and method for segregating data frames into two classes for managing buffer space.
The above and other objects of the invention are provided for by a network adaptor for implementing method of managing communication data. A network adaptor buffer memory is divided into pools including a plurality of tinygram contiguous sections and a plurality of jumbogram contiguous sections. The tinygram contiguous sections available for storage of packets are indicated by a list of pointers to the available tinygram contiguous sections. The jumbogram contiguous sections available for storage of packets are also indicated by a list of pointers to the available jumbogram contiguous sections. A threshold for distinguishing the packets as tinygrams and jumbograms is selected. Then, as packets are received, they are measured against the threshold. Responsive to detection of an end of packet condition prior to reaching the threshold, the packet is stored in a tinygram contiguous section. Otherwise, the packet is stored in a jumbogram contiguous section. The availability of sections is determined by query to the FIFO lists of pointers.
REFERENCES:
patent: 4788679 (1988-11-01), Kataoka et al.
patent: 4933932 (1990-06-01), Quinguis et al.
patent: 4953157 (1990-08-01), Franlilin et al.
patent: 4962497 (1990-10-01), Ferenc et al.
patent: 4991172 (1991-02-01), Cidon et al.
patent: 4993025 (1991-02-01), Vesel et al.
patent: 5126999 (1992-06-01), Munter et al.
patent: 5233606 (1993-08-01), Pasham et al.
patent: 5301192 (1994-04-01), Henrion
patent: 5416769 (1995-05-01), Karol
patent: 3203442 (1991-09-01), None
patent: 4192743 (1992-07-01), None
patent: 4237238 (1992-08-01), None
Branstad Mark William
Brech Brad Louis
Byrn Jonathan William
Delp Gary Scott
Montalvo Rafael M.
Felsman Bradley Vaden Gunter & Dillon, LLP
International Business Machines - Corporation
Ngo Ricky
LandOfFree
System and method for management a communications buffer does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for management a communications buffer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for management a communications buffer will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2548477