SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS

A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the ap...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Wilhelmsson, Jesper
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Wilhelmsson, Jesper
description A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_EP4012568A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EP4012568A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_EP4012568A13</originalsourceid><addsrcrecordid>eNqNyksKwjAURuFOHIi6h38DgvWF09vkNinkUZJMOipF4ki0UPePVVyAowOHb1mMsYuJLchJWE7aS9Q-QHaObCPImA6RDYvUOAWColCRYghvvtM7kFE-NElbVBRZYl5Jf4RL7FKEr6GZWgRWM4_rYnEb7lPe_LoqUHMSepvHZ5-ncbjmR3713B535f50vlB5-IO8ATHQNvo</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS</title><source>esp@cenet</source><creator>Wilhelmsson, Jesper</creator><creatorcontrib>Wilhelmsson, Jesper</creatorcontrib><description>A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time.</description><language>eng ; fre ; ger</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220615&amp;DB=EPODOC&amp;CC=EP&amp;NR=4012568A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76419</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20220615&amp;DB=EPODOC&amp;CC=EP&amp;NR=4012568A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Wilhelmsson, Jesper</creatorcontrib><title>SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS</title><description>A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyksKwjAURuFOHIi6h38DgvWF09vkNinkUZJMOipF4ki0UPePVVyAowOHb1mMsYuJLchJWE7aS9Q-QHaObCPImA6RDYvUOAWColCRYghvvtM7kFE-NElbVBRZYl5Jf4RL7FKEr6GZWgRWM4_rYnEb7lPe_LoqUHMSepvHZ5-ncbjmR3713B535f50vlB5-IO8ATHQNvo</recordid><startdate>20220615</startdate><enddate>20220615</enddate><creator>Wilhelmsson, Jesper</creator><scope>EVB</scope></search><sort><creationdate>20220615</creationdate><title>SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS</title><author>Wilhelmsson, Jesper</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_EP4012568A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng ; fre ; ger</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Wilhelmsson, Jesper</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wilhelmsson, Jesper</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS</title><date>2022-06-15</date><risdate>2022</risdate><abstract>A system and method for dynamically selecting a garbage collection algorithm based on the contents of heap regions. In accordance with an embodiment, a software application can be instrumented so that the system can place software objects allocated by the application, or by different parts of the application, into different regions of the heap. When garbage collection is invoked, the system can scan the heap, examine object statistics to determine if particular objects are, e.g., short-lived, long-lived, or some other type of object, and then use this information to determine which garbage collection algorithm to use with particular heap regions. In accordance with an embodiment, the system can identify regions as containing particular object types, for example, movable or non-movable object types, or object liveness, and use different garbage collection algorithms accordingly. Different garbage collection algorithms can be used with different regions, based on their content at a particular time.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng ; fre ; ger
recordid cdi_epo_espacenet_EP4012568A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title SYSTEM AND METHOD FOR DYNAMICALLY SELECTING A GARBAGE COLLECTION ALGORITHM BASED ON THE CONTENTS OF HEAP REGIONS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T18%3A39%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Wilhelmsson,%20Jesper&rft.date=2022-06-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EEP4012568A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true