Patent US5915255A successfully refreshed from Google Patents.
US5915255A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for referencing nodes using links
Assignee: Oracle America Inc
•
Filing: 1997-04-23
•
Granted: 1999-06-22
•
Expires: 2017-04-23
Abstract
Abstract Apparatus, methods, systems, and computer program products are disclosed that use a link to access nodes in a generational garbage collected heap. The creation area of the heap is associated with a validation variable that is dependent on the number of scavenge operations performed on the creation area. The link comprises the value of the validation variable when the node was allocated and the index of the created node within the creation area. When the node is copied from the creation area an entry is made in a link-to-pointer translation table. Accesses to the node using the link succeed regardless of whether the node is in the creation area. Thus, not all references to the node need to be updated when the node is copied from the creation area allowing the copying process to be interrupted when resolving links to the copied node.
Inventors
- 👤 David C. Schwartz
- 👤 Mario I. Wolczko
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 17:51
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/0223; G06F12/023; G06F12/0253; G06F12/0269; G06F12/0276; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99956; Y10S707/99957
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
83 words
A computer controlled method for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, wherein said method comprises steps of: (a) maintaining a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value depending on said plurality of scavenge operations; and (b) accessing a node through a link containing an offset value into said link-referenced creation area and a link validation value.
Claim 2
Dependent Claim
83 words
A computer controlled method for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, wherein said method comprises steps of: (a) maintaining a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value depending on said plurality of scavenge operations; and (b) accessing a node through a link containing an offset value into said link-referenced creation area and a link validation value.
Claim 3
Dependent Claim
64 words
The computer controlled method of claim 1 wherein the method further comprises steps of: (c) allocating said node from said generational garbage collected heap; and (d) constructing said link to contain said offset value and said link validation value, said link validation value provided from said current validation variable, and said offset value being an offset into said link-referenced creation area of said node.
Claim 4
Dependent Claim
44 words
The computer controlled method of claim 2 wherein step (b) comprises: (b1) using said offset value in said link for accessing said node in said link-referenced creation area if said link validation value in said link is the same as said area validation value.
Claim 5
Dependent Claim
52 words
The computer controlled method of claim 1 further comprising steps of: (c) copying said node from said link-referenced creation area to a copied node in a pointer-referenced heap area, said copied node referenced by a node pointer; and (d) constructing a link-to-pointer translation table for associating said link with said node pointer.
Claim 6
Dependent Claim
57 words
The computer controlled method of claim 4 wherein step (b) comprises: (b1) using said offset value and said link validation value in said link along with said link-to-pointer translation table for accessing said node outside of said link-referenced creation area if said link validation value in said link is not the same as said area validation value.
Claim 7
Dependent Claim
48 words
The computer controlled method of claim 1 wherein said method further comprises: (c) maintaining said link to said node after said node becomes a garbage node whereby said garbage node is referenced through said link without impacting any of said plurality of scavenge operations on said garbage node.
Claim 8
Dependent Claim
115 words
A computer system having a central processing unit (CPU) and a memory coupled to said CPU, for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said computer system comprising: a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 9
Dependent Claim
115 words
A computer system having a central processing unit (CPU) and a memory coupled to said CPU, for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said computer system comprising: a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 10
Dependent Claim
64 words
The computer system of claim 7 further comprising: a node allocation mechanism configured to allocate said node from said generational garbage collected heap; and a link construction mechanism configured to construct said link from said offset value and said link validation value, said link validation value copied from said area validation value, and said offset value being an offset into said link-referenced creation area.
Claim 11
Dependent Claim
52 words
The computer system of claim 8 with the node access mechanism further comprising: a creation area access mechanism configured to use said offset value in said link to access said node in said link-referenced creation area if said link validation value in said link is the same as said area validation value.
Claim 12
Dependent Claim
59 words
The computer system of claim 7 further comprising: a node copying mechanism configured to copy said node from said link-referenced creation area to a copied node in a pointer-referenced heap area, said copied node referenced by a node pointer; and a table construction mechanism configured to construct a link-to-pointer translation table to associate said link with said node pointer.
Claim 13
Dependent Claim
65 words
The computer system of claim 10 with the node access mechanism further comprising: a copied node access mechanism configured to use said offset value and said link validation value in said link along with said link-to-pointer translation table to access said node outside of said link-referenced creation area if said link validation value in said link is not the same as said area validation value.
Claim 14
Dependent Claim
48 words
The computer system of claim 7 further comprising: a maintenance mechanism configured to maintain said link to said node after said node becomes a garbage node whereby said garbage node is referenced through said link without impacting any of said plurality of scavenge operations on said garbage node.
Claim 15
Independent Claim
113 words
An apparatus having a central processing unit (CPU) and a memory coupled to said CPU, for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said apparatus comprising: a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 16
Independent Claim
113 words
An apparatus having a central processing unit (CPU) and a memory coupled to said CPU, for specifying a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said apparatus comprising: a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 17
Dependent Claim
64 words
The apparatus of claim 13 further comprising: a node allocation mechanism configured to allocate said node from said generational garbage collected heap; and a link construction mechanism configured to construct said link to contain said offset value and said link validation value, said link validation value copied from said area validation value, and said offset value being an offset into said link-referenced creation area.
Claim 18
Dependent Claim
51 words
The apparatus of claim 14 with the node access mechanism further comprising: a creation area access mechanism configured to use said offset value in said link to access said node in said link-referenced creation area if said link validation value in said link is the same as said area validation value.
Claim 19
Dependent Claim
58 words
The apparatus of claim 13 further comprising: a node copying mechanism configured to copy said node from said link-referenced creation area to a copied node in a pointer-referenced heap area, said copied node referenced by a node pointer; and a table construction mechanism configured to construct a link-to-pointer translation table to associate said link with said node pointer.
Claim 20
Dependent Claim
64 words
The apparatus of claim 16 with the node access mechanism further comprising: a copied node access mechanism configured to use said offset value and said link validation value in said link along with said link-to-pointer translation table to access said node outside of said link-referenced creation area if said link validation value in said link is not the same as said area validation value.
Claim 21
Dependent Claim
47 words
The apparatus of claim 13 further comprising: a maintenance mechanism configured to maintain said link to said node after said node becomes a garbage node whereby said garbage node is referenced through said link without impacting any of said plurality of scavenge operations on said garbage node.
Claim 22
Dependent Claim
144 words
A computer program product comprising: a computer usable storage medium having computer readable code embodied therein for causing a computer to specify a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said computer readable code comprising: computer readable program code devices configured to cause said computer to effect a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and computer readable program code devices configured to cause said computer to effect a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 23
Dependent Claim
144 words
A computer program product comprising: a computer usable storage medium having computer readable code embodied therein for causing a computer to specify a node originally allocated within a link-referenced creation area of a generational garbage collected heap subject to a plurality of scavenge operations, said computer readable code comprising: computer readable program code devices configured to cause said computer to effect a validation variable maintenance mechanism configured to maintain a current validation variable for said link-referenced creation area, said current validation variable containing an area validation value dependent on said plurality of scavenge operations; and computer readable program code devices configured to cause said computer to effect a node access mechanism configured to access a node through a link containing an offset value into said link-referenced creation area and a link validation value, said link validation value originally obtained from said current validation variable.
Claim 24
Dependent Claim
90 words
The computer program product of claim 19 further comprising: computer readable program code devices configured to cause said computer to effect a node allocation mechanism configured to allocate said node from said generational garbage collected heap; and computer readable program code devices configured to cause said computer to effect a link construction mechanism configured to construct said link to contain said offset value and said link validation value, said link validation value copied from said area validation value, and said offset value being an offset into said link-referenced creation area.
Claim 25
Dependent Claim
65 words
The computer program product of claim 20 with the node access mechanism further comprising: computer readable program code devices configured to cause said computer to effect a creation area access mechanism configured to use said offset value in said link to access said node in said link-referenced creation area if said link validation value in said link is the same as said area validation value.
Claim 26
Dependent Claim
84 words
The computer program product of claim 19 further comprising: computer readable program code devices configured to cause said computer to effect a node copying mechanism configured to copy said node from said link-referenced creation area to a copied node in a pointer-referenced heap area, said copied node referenced by a node pointer; and computer readable program code devices configured to cause said computer to effect a table construction mechanism configured to construct a link-to-pointer translation table to associate said link with said node pointer.
Claim 27
Dependent Claim
78 words
The computer program product of claim 22 with the node access mechanism further comprising: computer readable program code devices configured to cause said computer to effect a copied node access mechanism configured to use said offset value and said link validation value in said link along with said link-to-pointer translation table to access said node outside of said link-referenced creation area if said link validation value in said link is not the same as said area validation value.
Claim 28
Dependent Claim
61 words
The computer program product of claim 19 further comprising: computer readable program code devices configured to cause said computer to effect a maintenance mechanism configured to maintain said link to said node after said node becomes a garbage node whereby said garbage node is referenced through said link without impacting any of said plurality of scavenge operations on said garbage node.
References Cited (Backward Citations)
US4922414A
Cited
US4757438A
Cited
US4775932A
Cited
US4920483A
Cited
US5222221A
Cited
US4797810A
Cited
US4989134A
Cited
US4807120A
Cited
US5136706A
Cited
US4907151A
Cited
US5088036A
Cited
US5321834A
Cited
US5301288A
Cited
US5241673A
Cited
US5535329A
Cited
US5355483A
Cited
US5392432A
Cited
US5218698A
Cited
US5652883A
Cited
US5561786A
Cited
US5560003A
Cited
US5367685A
Cited
US5758347A
Cited
US5408650A
Cited
US5566321A
Cited
US5787430A
Cited
US5687368A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-06-21 | 2002-12-21 | 2003-06-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-06-21 | 2006-12-21 | 2007-06-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-06-21 | 2010-12-21 | 2011-06-22 | $7700.00 | Window Closed / Lapsed |