Method and apparatus for buffer partitioning without loss of data

An apparatus and method for moving and/or resizing logical buffers that comprise a memory space without the loss of data. Each buffer comprises a linear and contiguous set of storage locations, and operates according to a FIFO priority scheme, using a read address pointer to indicate the location fr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: SONNIER DAVID P, MOLLER HANAN Z, KOOB CHRISTOPHER
Format: Patent
Sprache:eng
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 SONNIER DAVID P
MOLLER HANAN Z
KOOB CHRISTOPHER
description An apparatus and method for moving and/or resizing logical buffers that comprise a memory space without the loss of data. Each buffer comprises a linear and contiguous set of storage locations, and operates according to a FIFO priority scheme, using a read address pointer to indicate the location from which data is read from the buffer and a write address pointer indicating the address into which data is written. A buffer is relocated or resized within the memory space by changing the base location address (defining the lowest storage location comprising the buffer) and/or the top location address (defining the highest memory location within the buffer) into free storage locations. To accomplish this relocation or resizing without the loss of data, the read address is first checked to determine if it bears an appropriate relationship to the new base and top memory locations.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6801991B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6801991B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6801991B23</originalsourceid><addsrcrecordid>eNrjZHD0TS3JyE9RSMwD4oKCxKLEktJihbT8IoWk0rS01CIFoFBJZklmfl5mXrpCeSZQcWmJQk5-cbFCfppCSmJJIg8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiQ8NNrMwMLS0NHQyMiZCCQC5fjGg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and apparatus for buffer partitioning without loss of data</title><source>esp@cenet</source><creator>SONNIER DAVID P ; MOLLER HANAN Z ; KOOB CHRISTOPHER</creator><creatorcontrib>SONNIER DAVID P ; MOLLER HANAN Z ; KOOB CHRISTOPHER</creatorcontrib><description>An apparatus and method for moving and/or resizing logical buffers that comprise a memory space without the loss of data. Each buffer comprises a linear and contiguous set of storage locations, and operates according to a FIFO priority scheme, using a read address pointer to indicate the location from which data is read from the buffer and a write address pointer indicating the address into which data is written. A buffer is relocated or resized within the memory space by changing the base location address (defining the lowest storage location comprising the buffer) and/or the top location address (defining the highest memory location within the buffer) into free storage locations. To accomplish this relocation or resizing without the loss of data, the read address is first checked to determine if it bears an appropriate relationship to the new base and top memory locations.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2004</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=20041005&amp;DB=EPODOC&amp;CC=US&amp;NR=6801991B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20041005&amp;DB=EPODOC&amp;CC=US&amp;NR=6801991B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SONNIER DAVID P</creatorcontrib><creatorcontrib>MOLLER HANAN Z</creatorcontrib><creatorcontrib>KOOB CHRISTOPHER</creatorcontrib><title>Method and apparatus for buffer partitioning without loss of data</title><description>An apparatus and method for moving and/or resizing logical buffers that comprise a memory space without the loss of data. Each buffer comprises a linear and contiguous set of storage locations, and operates according to a FIFO priority scheme, using a read address pointer to indicate the location from which data is read from the buffer and a write address pointer indicating the address into which data is written. A buffer is relocated or resized within the memory space by changing the base location address (defining the lowest storage location comprising the buffer) and/or the top location address (defining the highest memory location within the buffer) into free storage locations. To accomplish this relocation or resizing without the loss of data, the read address is first checked to determine if it bears an appropriate relationship to the new base and top memory locations.</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>2004</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHD0TS3JyE9RSMwD4oKCxKLEktJihbT8IoWk0rS01CIFoFBJZklmfl5mXrpCeSZQcWmJQk5-cbFCfppCSmJJIg8Da1piTnEqL5TmZlBwcw1x9tBNLciPTy0uSExOzUstiQ8NNrMwMLS0NHQyMiZCCQC5fjGg</recordid><startdate>20041005</startdate><enddate>20041005</enddate><creator>SONNIER DAVID P</creator><creator>MOLLER HANAN Z</creator><creator>KOOB CHRISTOPHER</creator><scope>EVB</scope></search><sort><creationdate>20041005</creationdate><title>Method and apparatus for buffer partitioning without loss of data</title><author>SONNIER DAVID P ; MOLLER HANAN Z ; KOOB CHRISTOPHER</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6801991B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2004</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>SONNIER DAVID P</creatorcontrib><creatorcontrib>MOLLER HANAN Z</creatorcontrib><creatorcontrib>KOOB CHRISTOPHER</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SONNIER DAVID P</au><au>MOLLER HANAN Z</au><au>KOOB CHRISTOPHER</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and apparatus for buffer partitioning without loss of data</title><date>2004-10-05</date><risdate>2004</risdate><abstract>An apparatus and method for moving and/or resizing logical buffers that comprise a memory space without the loss of data. Each buffer comprises a linear and contiguous set of storage locations, and operates according to a FIFO priority scheme, using a read address pointer to indicate the location from which data is read from the buffer and a write address pointer indicating the address into which data is written. A buffer is relocated or resized within the memory space by changing the base location address (defining the lowest storage location comprising the buffer) and/or the top location address (defining the highest memory location within the buffer) into free storage locations. To accomplish this relocation or resizing without the loss of data, the read address is first checked to determine if it bears an appropriate relationship to the new base and top memory locations.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US6801991B2
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Method and apparatus for buffer partitioning without loss of data
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T17%3A34%3A30IST&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=SONNIER%20DAVID%20P&rft.date=2004-10-05&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6801991B2%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