公开(公告)号：US20230019686A1

公开(公告)日：2023-01-19

申请号：US17369447

申请日：2021-07-07

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Ivan Walulya

IPC: G06F12/02

Abstract: Techniques for on-the-fly adaptation of remembered set data structures are disclosed. Operations include initiating execution of an application thread and a garbage collection process for a heap memory including a first plurality of logical partitions, wherein each logical partition of the first plurality of logical partitions is associated with a remembered set data structure. While the application thread and the garbage collection process are executing, the system determines a set of characteristics. Based on the set of characteristics meeting threshold criteria for adjusting a first remembered set data structure corresponding to a first logical partition, the system identifies a first remembered set configuration corresponding to the first remembered set data structure, creates a replacement remembered set data structure based on the first remembered set configuration, and associates the replacement remembered set data structure with the first logical partition.

公开(公告)号：US10318585B2

公开(公告)日：2019-06-11

申请号：US14954358

申请日：2015-11-30

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F12/02 ,  G06F16/901 ,  G06F16/17

Abstract: The disclosed embodiments provide a remembered set implementation for use during an incremental garbage collection, wherein the implementation includes a trie that can be dynamically coarsened to conserve memory. During operation, responsive to storing a reference into a location in a referenced memory area during the execution of a software program, the system finds, within a trie that serves as a remembered set for the referenced memory area, a particular entry that corresponds to a particular address range that covers the location. The system then marks the particular entry to indicate that the particular address range should be processed during a garbage collection. Based on a policy, the system then coarsens a particular subtree of the trie in which the particular entry is stored. Next, during the garbage collection, the system processes a particular larger address range when a root entry of the particular subtree is visited.

公开(公告)号：US20170153973A1

公开(公告)日：2017-06-01

申请号：US14954358

申请日：2015-11-30

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F12/02 ,  G06F12/10

CPC classification number: G06F12/0269

Abstract: The disclosed embodiments provide a remembered set implementation for use during an incremental garbage collection, wherein the implementation includes a trie that can be dynamically coarsened to conserve memory. During operation, responsive to storing a reference into a location in a referenced memory area during the execution of a software program, the system finds, within a trie that serves as a remembered set for the referenced memory area, a particular entry that corresponds to a particular address range that covers the location. The system then marks the particular entry to indicate that the particular address range should be processed during a garbage collection. Based on a policy, the system then coarsens a particular subtree of the trie in which the particular entry is stored. Next, during the garbage collection, the system processes a particular larger address range when a root entry of the particular subtree is visited.

公开(公告)号：US11789863B2

公开(公告)日：2023-10-17

申请号：US17369447

申请日：2021-07-07

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Ivan Walulya

IPC: G06F12/02

CPC classification number: G06F12/0253 ,  G06F2212/7205

Abstract: Techniques for on-the-fly adaptation of remembered set data structures are disclosed. Operations include initiating execution of an application thread and a garbage collection process for a heap memory including a first plurality of logical partitions, wherein each logical partition of the first plurality of logical partitions is associated with a remembered set data structure. While the application thread and the garbage collection process are executing, the system determines a set of characteristics. Based on the set of characteristics meeting threshold criteria for adjusting a first remembered set data structure corresponding to a first logical partition, the system identifies a first remembered set configuration corresponding to the first remembered set data structure, creates a replacement remembered set data structure based on the first remembered set configuration, and associates the replacement remembered set data structure with the first logical partition.

公开(公告)号：US11237958B1

公开(公告)日：2022-02-01

申请号：US17146135

申请日：2021-01-11

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Erik Duveblad

IPC: G06F12/00 ,  G06F12/02 ,  G06F12/0891

Abstract: A garbage collection process, wherein a system, concurrently with execution of a mutator application that modifies a heap memory computes, for each of a plurality of regions in the heap memory, an estimate indicative of a time required to evacuate the respective region. Thereafter, during a garbage collection pause having a particular pause duration, the system selects a candidate subset of memory regions for evacuation. The system merges the estimates indicative of the time required to evacuate each region of the candidate subset and determines a remaining time during the pause. The system may determine that the total estimated evacuation time to evacuate the candidate subset of regions does not exceed the determined first remaining time, and may evacuate each region in the candidate subset of memory regions for evacuation.

公开(公告)号：US10417125B2

公开(公告)日：2019-09-17

申请号：US15041794

申请日：2016-02-11

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F3/06 ,  G06F12/02

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.

公开(公告)号：US11294806B2

公开(公告)日：2022-04-05

申请号：US16526212

申请日：2019-07-30

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F12/02

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.

公开(公告)号：US20190354477A1

公开(公告)日：2019-11-21

申请号：US16526212

申请日：2019-07-30

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F12/02

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.

公开(公告)号：US20170235518A1

公开(公告)日：2017-08-17

申请号：US15041794

申请日：2016-02-11

Applicant: Oracle International Corporation

Inventor： Thomas Schatzl ,  Nils Mikael Gerdin ,  Erik Gustav Helin

IPC: G06F3/06

CPC classification number: G06F12/0269 ,  G06F12/02 ,  G06F12/0276 ,  G06F2212/1016 ,  G06F2212/702

Abstract: The disclosed embodiments provide a method, apparatus, and system for selecting, based on feedback from previous garbage collections, a portion of a referenced memory area for garbage collection within a time window. During the execution of a software program, the system selects a given portion of a referenced memory area on which garbage collection can be completed within the given time window and attempts to complete garbage collection on at least the given portion of the referenced memory area before the end of the given time window. Next, the system selects, based on the results of the garbage collection performed during the given time window, a subsequent portion of the referenced memory area on which garbage collection can be completed within the subsequent time window and attempts to complete garbage collection on at least the subsequent portion of the referenced memory area before the end of the subsequent time window.