Multiplex communications – Wide area network – Packet switching
Patent
1996-11-12
1999-03-09
Ray, Gopal C.
Multiplex communications
Wide area network
Packet switching
370429, G06F 1300
Patent
active
058813160
ABSTRACT:
The space of a buffer is logically partitioned into space reserved for requests only, space reserved for responses only, and space that can be used for either requests or responses, i.e., dynamically usable as needed by the system. An arbiter uses three registers to keep track of the request buffer space, the response buffer space and the dynamic space. The arbiter compares each of the registers with a corresponding limit to determine if a request packet or a response packet should be sent to the buffer. The limits are set by software and define the maximum number of request products, response packets, and total number of packets the buffer can hold. For example, the limit may be set to eight requests, eight responses and ten total. Thus two spaces are reserved for requests and two spaces are reserved for responses, and six are dynamically usable.
REFERENCES:
patent: 4788679 (1988-11-01), Kataoka et al.
patent: 4922438 (1990-05-01), Ballweg
patent: 5448701 (1995-09-01), Metz, Jr. et al.
patent: 5473604 (1995-12-01), Lorenz et al.
patent: 5517615 (1996-05-01), Sefidvash et al.
patent: 5541932 (1996-07-01), Nguyen et al.
Chaney Kenneth
Ruff Michael T.
Hewlett--Packard Company
Ray Gopal C.
LandOfFree
Dynamic allocation of queue space using counters does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dynamic allocation of queue space using counters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic allocation of queue space using counters will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1331820