Patent US5430846A successfully refreshed from Google Patents.
US5430846A
Expired / Lapsed
US
⏱️ 0.0 years remaining
List-based buffering mechanism for buffering data between processes in a data processing system
Assignee: Fujitsu Services Ltd
•
Filing: 1993-03-15
•
Granted: 1995-07-04
•
Expires: 2013-03-15
Abstract
Abstract A data processing system is described, having a buffering mechanism for buffering data between two processes. The buffering mechanism includes a container table consisting of a number of data storage containers, an allocation list indicating which containers are free, and a communication list indicating which containers currently hold data waiting to be read by the recipient. The originator writes data into the first container indicated as free by the allocation list, removing that container from the allocation list and adding that container as the last container on the communication list. The recipient reads data from the first container indicated as in use by the communication list, removing that container from the communication list, and adding that container as the last free container on the allocation list.
Inventors
- 👤 Stephen J. Moore
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 18:29
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/544
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
213 words
A data processing system comprising: (a) a buffer comprising a plurality of data storage containers; (b) an originator entity, coupled to said buffer, for writing data into said buffer; (c) a recipient entity, coupled to said buffer, for reading data from said buffer; (d) a first list comprising a sequence of entries, said first list having a head and a tail; and (e) a second list comprising a sequence of entries, said second list having a head and a tail; (f) said originator entity comprising means for removing an entry from the head of the first list, and for using said entry from the head of the first list as an index for selecting one of said data storage containers for writing by said originator entity, and for then adding said entry from the head of the first list to the tail of the second list; and (g) said recipient entity comprising means for removing an entry from the head of the second list, and for using said entry from the head of the second list as an index for selecting one of said data storage containers for reading by said recipient entity, and for then adding said entry from the head of the second list to the tail of the first list.
Claim 2
Dependent Claim
213 words
A data processing system comprising: (a) a buffer comprising a plurality of data storage containers; (b) an originator entity, coupled to said buffer, for writing data into said buffer; (c) a recipient entity, coupled to said buffer, for reading data from said buffer; (d) a first list comprising a sequence of entries, said first list having a head and a tail; and (e) a second list comprising a sequence of entries, said second list having a head and a tail; (f) said originator entity comprising means for removing an entry from the head of the first list, and for using said entry from the head of the first list as an index for selecting one of said data storage containers for writing by said originator entity, and for then adding said entry from the head of the first list to the tail of the second list; and (g) said recipient entity comprising means for removing an entry from the head of the second list, and for using said entry from the head of the second list as an index for selecting one of said data storage containers for reading by said recipient entity, and for then adding said entry from the head of the second list to the tail of the first list.
Claim 3
Dependent Claim
30 words
A system according to claim 1 wherein said sequence of entries in each of said first list and said second list include jump entries for indicating jumps in said sequence.
Claim 4
Dependent Claim
36 words
A system according to claim 2 wherein there are M of said data storage containers in said buffer and wherein there are M+2 of said entries in each of said first list and said second list.
Claim 5
Dependent Claim
61 words
A system according to claim 3 wherein said originator entity further includes means for extending said buffer by: (a) creating N new data storage containers in said buffer; and (b) creating N+2 new entries in each of said first list and said second list, said new entries including two jump entries in each of said first list and said second list.
Claim 6
Dependent Claim
241 words
In a data processing system comprising: (a) a buffer comprising a plurality of data storage containers; (b) an originator entity, coupled to said buffer, for writing data into said buffer; (c) a recipient entity, coupled to said buffer, for reading data from said buffer; (d) a first list comprising a sequence of entries, said first list having a head and a tail; and (e) a second list comprising a sequence of entries, said second list having a head and a tail; a method of transferring data between said originator entity and said recipient entity comprising steps as follows: (i) removing an entry from the head of the first list; (ii) using said entry from the head of the first list as an index for selecting one of said data storage containers; (iii) writing data from said originator entity into said one of said data storage containers referred to in step (ii); (iv) adding said entry from the head of the first list to the tail of the second list; (v) removing an entry from the head of the second list; (vi) using said entry from the head of the second list as an index for selecting one of said data storage containers; (vii) reading data to said recipient entity from said one of said data storage containers referred to in step (vi); and (viii) adding said entry from the head of the second list to the tail of the first list.
Claim 7
Dependent Claim
241 words
In a data processing system comprising: (a) a buffer comprising a plurality of data storage containers; (b) an originator entity, coupled to said buffer, for writing data into said buffer; (c) a recipient entity, coupled to said buffer, for reading data from said buffer; (d) a first list comprising a sequence of entries, said first list having a head and a tail; and (e) a second list comprising a sequence of entries, said second list having a head and a tail; a method of transferring data between said originator entity and said recipient entity comprising steps as follows: (i) removing an entry from the head of the first list; (ii) using said entry from the head of the first list as an index for selecting one of said data storage containers; (iii) writing data from said originator entity into said one of said data storage containers referred to in step (ii); (iv) adding said entry from the head of the first list to the tail of the second list; (v) removing an entry from the head of the second list; (vi) using said entry from the head of the second list as an index for selecting one of said data storage containers; (vii) reading data to said recipient entity from said one of said data storage containers referred to in step (vi); and (viii) adding said entry from the head of the second list to the tail of the first list.
References Cited (Backward Citations)
US4864495A
Cited
US4956771A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-07-03 | 1999-01-02 | 1999-07-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-07-03 | 2003-01-02 | 2003-07-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-07-03 | 2007-01-02 | 2007-07-04 | $7700.00 | Window Closed / Lapsed |