US5247684A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Light update notification mechanism for shared data structures
Assignee: United States Department of the Navy
•
Filing: 1991-10-03
•
Granted: 1993-09-21
•
Expires: 2011-10-03
Abstract
Abstract A system for updating and reading a data base utilizes a pair of counters rking in conjunction with registers located within RAM to enable one upon reading the data base to know if a data base record has been added, deleted, or revised. The system also notifies if the data base is being updated on attempting a read process or during the reading. The updating is performed by a writer that is never inhibited from updating the data base.
Inventors
- 👤 Carlos M. Tavares
- 👤 Durval M. Tavares
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 11:37
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/52; G06F9/526; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99938
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
344 words
A method of providing a low overhead update notification for concurrent processes sharing RAM within a computer system comprising the steps of: incrementing by one an update-counter within said computer system; determining if nature of an update is adding a record; incrementing by one a new-or-removed-flag counter within said computer system when nature of an update is adding a record; updating a data base record when nature of update is one of adding a record and revising a record; determining if nature of said update is deleting a record when nature of update is not adding a record; incrementing by one said new-or-removed-flag counter when nature of said update is deleting a record; incrementing by one said update-counter; setting a register (U) within said computer system equal to said update-counter; checking if said register (U) is not equal to old (U); taking alternative action and canceling the remaining steps if said register (U) was equal to said old (U); checking if a register (U) modulus 2 is equal to zero if said register (U) was not equal to said old (U); taking alternative action and canceling the remaining steps if said register (U) modulus 2 was not equal to zero; accessing said data base record if said register (U) modulus 2 was equal to zero; setting a register (N) equal to said new-or-removed flag counter; checking if said register (U) is not equal to said update-counter; taking alternative action and canceling the remaining steps if said register (U) is not equal to said update-counter; checking if said register (N) is equal to old (N) if said register (U) is equal to said update-counter; indicating revised record if said register (N) is equal to old (N); checking if register (N) modulus 2 is equal to zero if register (N) is not equal to old (N); indicating deleted record if register (N) modulus 2 is equal to zero; indicating added record if register (N) modulus 2 is not equal to zero: setting old (U) equal to register (U); and setting old (N) equal to register (N).
Claim 2
Independent Claim
344 words
A method of providing a low overhead update notification for concurrent processes sharing RAM within a computer system comprising the steps of: incrementing by one an update-counter within said computer system; determining if nature of an update is adding a record; incrementing by one a new-or-removed-flag counter within said computer system when nature of an update is adding a record; updating a data base record when nature of update is one of adding a record and revising a record; determining if nature of said update is deleting a record when nature of update is not adding a record; incrementing by one said new-or-removed-flag counter when nature of said update is deleting a record; incrementing by one said update-counter; setting a register (U) within said computer system equal to said update-counter; checking if said register (U) is not equal to old (U); taking alternative action and canceling the remaining steps if said register (U) was equal to said old (U); checking if a register (U) modulus 2 is equal to zero if said register (U) was not equal to said old (U); taking alternative action and canceling the remaining steps if said register (U) modulus 2 was not equal to zero; accessing said data base record if said register (U) modulus 2 was equal to zero; setting a register (N) equal to said new-or-removed flag counter; checking if said register (U) is not equal to said update-counter; taking alternative action and canceling the remaining steps if said register (U) is not equal to said update-counter; checking if said register (N) is equal to old (N) if said register (U) is equal to said update-counter; indicating revised record if said register (N) is equal to old (N); checking if register (N) modulus 2 is equal to zero if register (N) is not equal to old (N); indicating deleted record if register (N) modulus 2 is equal to zero; indicating added record if register (N) modulus 2 is not equal to zero: setting old (U) equal to register (U); and setting old (N) equal to register (N).
Claim 3
Dependent Claim
37 words
A method for providing low overhead update notification for concurrent processes in data structures according to claim 1, wherein such concurrent processes include a writer processing entity to achieve the step of updating a data base record.
Claim 4
Dependent Claim
40 words
A method for providing low overhead update notification for concurrent processes in data structures according to claim 2, wherein such concurrent processes further include at least one reader processing entity to achieve the step of accessing said data base record.
Claim 5
Independent Claim
207 words
A method of providing a low overhead update notification for concurrent processes sharing RAM within a computer system comprising the steps of: updating a data base record with a writer within said computer system by means of one of adding, deleting and revising a record; incrementing two counters within said computer system a predetermined number of times dependent on which one of said adding, said deleting, said revising a record is performed, and whether said updating of said data base record is still in progress; attempting access of said data base record with a reader and determining by the numerical value of one of said two counters whether said updating of said data base record is still in progress; inhibiting access of said data base record with said reader upon said updating of said data base record being in progress; accessing of said data base record with said reader upon said step of updating of said data base record with said writer being completed; and permitting a new updating of said data base record with said writer upon one of said accessing of said data base record with said reader being still in progress and said accessing of said data base record with said reader being completed.
Claim 6
Independent Claim
207 words
A method of providing a low overhead update notification for concurrent processes sharing RAM within a computer system comprising the steps of: updating a data base record with a writer within said computer system by means of one of adding, deleting and revising a record; incrementing two counters within said computer system a predetermined number of times dependent on which one of said adding, said deleting, said revising a record is performed, and whether said updating of said data base record is still in progress; attempting access of said data base record with a reader and determining by the numerical value of one of said two counters whether said updating of said data base record is still in progress; inhibiting access of said data base record with said reader upon said updating of said data base record being in progress; accessing of said data base record with said reader upon said step of updating of said data base record with said writer being completed; and permitting a new updating of said data base record with said writer upon one of said accessing of said data base record with said reader being still in progress and said accessing of said data base record with said reader being completed.
Claim 7
Dependent Claim
52 words
A method of providing a low overhead update notification for concurrent processes within a computer system according to claim 4 further comprising the step of: indicating a collision when said new updating of said data base record with said writer occurs during said accessing of said data base record with said reader.
Claim 8
Dependent Claim
65 words
A method of providing low overhead update notification for concurrent processes within a computer system according to claim 5 further comprising the step of: indicating which one of said adding, deleting, and revising a record with said writer occurred prior to said step of accessing of said data base record with said reader when there is the absence of said step of indicating a collision.
References Cited (Backward Citations)
US4441163A
Cited
US5151988A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-09-20 | 1997-03-22 | 1997-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-09-20 | 2001-03-22 | 2001-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-09-20 | 2005-03-22 | 2005-09-21 | $7700.00 | Window Closed / Lapsed |