Method for providing concurrent non-blocking heap memory management for fixed sized blocks
The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng |
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 | Bonola, Thomas |
description | The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return is to the end or bottom of the linked list. In this way, software streams may remove and return blocks of heap memory simultaneously with hardware devices returning blocks of heap memory. |
format | Patent |
fullrecord | <record><control><sourceid>uspatents_EFI</sourceid><recordid>TN_cdi_uspatents_applications_20030120885</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>20030120885</sourcerecordid><originalsourceid>FETCH-uspatents_applications_200301208853</originalsourceid><addsrcrecordid>eNqVi7EKwjAURbs4iPoPb3UoxBahuygubk4u5Zm-tqHJeyFJRf16W_EHXO6ByznL7Hah1EsDrQTwQR6mMdyBFtZjCMQJWDi_W9HD_PeEHhw5CS9wyNiRm505bs2TGojmPe3Xj-ts0aKNtPlxlW1Px-vhnI_RY5q6WKP31mhMRjjWhVKl2hWqqvblP-4HsXpCcQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method for providing concurrent non-blocking heap memory management for fixed sized blocks</title><source>USPTO Published Applications</source><creator>Bonola, Thomas</creator><creatorcontrib>Bonola, Thomas</creatorcontrib><description>The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return is to the end or bottom of the linked list. In this way, software streams may remove and return blocks of heap memory simultaneously with hardware devices returning blocks of heap memory.</description><language>eng</language><creationdate>2003</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/20030120885$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,780,873,885,64059</link.rule.ids><linktorsrc>$$Uhttps://patentcenter.uspto.gov/applications/10037806$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Bonola, Thomas</creatorcontrib><title>Method for providing concurrent non-blocking heap memory management for fixed sized blocks</title><description>The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return is to the end or bottom of the linked list. In this way, software streams may remove and return blocks of heap memory simultaneously with hardware devices returning blocks of heap memory.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2003</creationdate><recordtype>patent</recordtype><sourceid>EFI</sourceid><recordid>eNqVi7EKwjAURbs4iPoPb3UoxBahuygubk4u5Zm-tqHJeyFJRf16W_EHXO6ByznL7Hah1EsDrQTwQR6mMdyBFtZjCMQJWDi_W9HD_PeEHhw5CS9wyNiRm505bs2TGojmPe3Xj-ts0aKNtPlxlW1Px-vhnI_RY5q6WKP31mhMRjjWhVKl2hWqqvblP-4HsXpCcQ</recordid><startdate>20030626</startdate><enddate>20030626</enddate><creator>Bonola, Thomas</creator><scope>EFI</scope></search><sort><creationdate>20030626</creationdate><title>Method for providing concurrent non-blocking heap memory management for fixed sized blocks</title><author>Bonola, Thomas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_applications_200301208853</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Bonola, Thomas</creatorcontrib><collection>USPTO Published Applications</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bonola, Thomas</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method for providing concurrent non-blocking heap memory management for fixed sized blocks</title><date>2003-06-26</date><risdate>2003</risdate><abstract>The specification discloses a heap memory management system in which software streams remove and replace blocks of heap memory from the heap pile, managed in a linked list fashion, in a last-in/first-out fashion at the top of the list. A hardware device returns blocks of heap memory, and this return is to the end or bottom of the linked list. In this way, software streams may remove and return blocks of heap memory simultaneously with hardware devices returning blocks of heap memory.</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | eng |
recordid | cdi_uspatents_applications_20030120885 |
source | USPTO Published Applications |
title | Method for providing concurrent non-blocking heap memory management for fixed sized blocks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T23%3A14%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFI&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Bonola,%20Thomas&rft.date=2003-06-26&rft_id=info:doi/&rft_dat=%3Cuspatents_EFI%3E20030120885%3C/uspatents_EFI%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 |