Patent US6038572A successfully refreshed from Google Patents.
US6038572A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for localizing nodes in a garbage collected carded heap
Assignee: Oracle America Inc
•
Filing: 1997-04-23
•
Granted: 2000-03-14
•
Expires: 2017-04-23
Abstract
Abstract Apparatus, methods, systems and computer program products are disclosed describing processes that optimize generational garbage collection techniques in a card-marked heap. The invention localizes nodes in an older generation that have a pointer to a newer generation. This node localization increases the density of such nodes in the cards marked as having these nodes and thus reduces the number of marked cards that need to be examined for nodes having pointers to the newer generation.
Inventors
- 👤 David C. Schwartz
- 👤 Ross C. Knippel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 03:06
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: 20
Claim 1
Independent Claim
94 words
A computer controlled method for localizing a first plurality of nodes in a card-marked older generation heap area, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said method comprises steps of: (a) collecting said first plurality of nodes to a card-marked copied generation; and (b) collecting said second plurality of remaining nodes to said card-marked copied generation.
Claim 2
Dependent Claim
94 words
A computer controlled method for localizing a first plurality of nodes in a card-marked older generation heap area, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said method comprises steps of: (a) collecting said first plurality of nodes to a card-marked copied generation; and (b) collecting said second plurality of remaining nodes to said card-marked copied generation.
Claim 3
Dependent Claim
44 words
The computer controlled method of claim 1 wherein step (a) comprises steps of: (a1) iterating over said intermixed plurality of nodes; (a2) remembering said second plurality of remaining nodes; and (a3) copying each of said first plurality of nodes to said card-marked copied generation.
Claim 4
Dependent Claim
38 words
The computer controlled method of claim 2 wherein step (b) comprises steps of: (b1) iterating over said second plurality of remaining nodes; and (b2) copying each of said second plurality of remaining nodes to said card-marked copied generation.
Claim 5
Dependent Claim
21 words
The computer controlled method of claim 2 wherein step (a) further comprises marking a card marker in said card-marked copied generation.
Claim 6
Dependent Claim
124 words
A computer controlled system having a central processing unit (CPU) and a memory coupled to said CPU, for localizing a first plurality of nodes in a card-marked older generation heap area of said memory, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area of said memory, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said system comprises: a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation in said memory; and a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 7
Dependent Claim
124 words
A computer controlled system having a central processing unit (CPU) and a memory coupled to said CPU, for localizing a first plurality of nodes in a card-marked older generation heap area of said memory, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area of said memory, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said system comprises: a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation in said memory; and a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 8
Dependent Claim
58 words
The computer controlled system of claim 5 wherein the first collection mechanism comprises: a first iteration mechanism configured to iterate over said intermixed plurality of nodes; a storage mechanism configured to remember said second plurality of remaining nodes; and a first copy mechanism configured to copy each of said first plurality of nodes to said card-marked copied generation.
Claim 9
Dependent Claim
48 words
The computer controlled system of claim 6 wherein the second collection mechanism comprises: a second iteration mechanism configured to iterate over said second plurality of remaining nodes; and a second copy mechanism configured to copy each of said second plurality of remaining nodes to said card-marked copied generation.
Claim 10
Dependent Claim
29 words
The computer controlled system of claim 6 wherein the first collection mechanism further comprises a card marking mechanism configured to mark a card marker in said card-marked copied generation.
Claim 11
Independent Claim
122 words
An apparatus having a central processing unit (CPU) and a memory coupled to said CPU for localizing a first plurality of nodes in a card-marked older generation heap area of said memory, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area of said memory, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said system comprises: a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation in said memory; and a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 12
Independent Claim
122 words
An apparatus having a central processing unit (CPU) and a memory coupled to said CPU for localizing a first plurality of nodes in a card-marked older generation heap area of said memory, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area of said memory, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, wherein said system comprises: a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation in said memory; and a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 13
Dependent Claim
56 words
The apparatus of claim 9 wherein the first collection mechanism comprises: a first iteration mechanism configured to iterate over said intermixed plurality of nodes; a storage mechanism configured to remember said second plurality of remaining nodes; and a first copy mechanism configured to copy each of said first plurality of nodes to said card-marked copied generation.
Claim 14
Dependent Claim
46 words
The apparatus of claim 10 wherein the second collection mechanism comprises: a second iteration mechanism configured to iterate over said second plurality of remaining nodes; and a second copy mechanism configured to copy each of said second plurality of remaining nodes to said card-marked copied generation.
Claim 15
Dependent Claim
27 words
The apparatus of claim 10 wherein the first collection mechanism further comprises a card marking mechanism configured to mark a card marker in said card-marked copied generation.
Claim 16
Dependent Claim
143 words
A computer program product comprising: a computer usable storage medium having computer readable code embodied therein for causing a computer to locate a first plurality of nodes in a card-marked older generation heap area, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, said computer readable code comprising: computer readable program code devices configured to cause said computer to effect a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation; and computer readable program code devices configured to cause said computer to effect a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 17
Dependent Claim
143 words
A computer program product comprising: a computer usable storage medium having computer readable code embodied therein for causing a computer to locate a first plurality of nodes in a card-marked older generation heap area, each of said first plurality of nodes containing a pointer to an address in a younger generation heap area, said card-marked older generation heap area having an intermixed plurality of nodes of said first plurality of nodes with a second plurality of remaining nodes, said computer readable code comprising: computer readable program code devices configured to cause said computer to effect a first collection mechanism configured to collect said first plurality of nodes to a card-marked copied generation; and computer readable program code devices configured to cause said computer to effect a second collection mechanism configured to collect said second plurality of remaining nodes to said card-marked copied generation.
Claim 18
Dependent Claim
94 words
The computer program product of claim 13 wherein the first collection mechanism comprises: computer readable program code devices configured to cause said computer to effect a first iteration mechanism configured to iterate over said intermixed plurality of nodes; computer readable program code devices configured to cause said computer to effect a storage mechanism configured to remember said second plurality of remaining nodes; and computer readable program code devices configured to cause said computer to effect a first copy mechanism configured to copy each of said first plurality of nodes to said card-marked copied generation.
Claim 19
Dependent Claim
72 words
The computer program product of claim 14 wherein the second collection mechanism comprises: computer readable program code devices configured to cause said computer to effect a second iteration mechanism configured to iterate over said second plurality of remaining nodes; and computer readable program code devices configured to cause said computer to effect a second copy mechanism configured to copy each of said second plurality of remaining nodes to said card-marked copied generation.
Claim 20
Dependent Claim
41 words
The computer program product of claim 14 wherein the first collection mechanism further comprises computer readable program code devices configured to cause said computer to effect a card marking mechanism configured to mark a card marker in said card-marked copied generation.
References Cited (Backward Citations)
US4922414A
Cited
US4757438A
Cited
US4775932A
Cited
US4920483A
Cited
US5222221A
Cited
US4989134A
Cited
US5136706A
Cited
US4907151A
Cited
US5088036A
Cited
US5321834A
Cited
US5301288A
Cited
US5535329A
Cited
US5355483A
Cited
US5218698A
Cited
US5561786A
Cited
US5560003A
Cited
US5367685A
Cited
US5408650A
Cited
US5566321A
Cited
US5379431A
Cited
US5574915A
Cited
US5590332A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-03-14 | 2003-09-13 | 2004-03-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-03-14 | 2007-09-13 | 2008-03-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-03-14 | 2011-09-13 | 2012-03-14 | $7700.00 | Window Closed / Lapsed |