Software paging system

A method for translating, in a software paging system, an input key describing a virtual page to the address of the page in main memory, comprises creating, in main memory, a translation buffer which has a plurality of records. Each record has a plurality of cells, each cell having a key field for s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: HOPEMAN ALBERT, LYUBASHEVSKIY IGOR, CAREY JAMES E
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 HOPEMAN ALBERT
LYUBASHEVSKIY IGOR
CAREY JAMES E
description A method for translating, in a software paging system, an input key describing a virtual page to the address of the page in main memory, comprises creating, in main memory, a translation buffer which has a plurality of records. Each record has a plurality of cells, each cell having a key field for storing a key or a portion of a key which identifies a page in memory, and each cell having an address field for storing the address of the identified page. If the input key matches a stored key, the address associated with the identified page is retrieved. Otherwise, a paging manager is invoked to establish an address for the input key, and the input key and established address are saved. The least recently used order of memory pages addressed in the dereferenced record is indicated by updating a least recently used cell indicator associated with the dereferenced record. Alternatively, a table having a plurality of entries is created, wherein each entry references a respective hash chain of translation records in a main memory translation buffer. Each translation record has a key field for storing a key identifying a page, and an associated address field for storing the address of the identified page in memory. The records of the hash chain are searched until a translation record is found which has a key value matching the input key.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US6480950B1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US6480950B1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US6480950B13</originalsourceid><addsrcrecordid>eNrjZBALzk8rKU8sSlUoSEzPzEtXKK4sLknN5WFgTUvMKU7lhdLcDApuriHOHrqpBfnxqcUFicmpeakl8aHBZiYWBpamBk6GxkQoAQBzRyFz</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Software paging system</title><source>esp@cenet</source><creator>HOPEMAN ALBERT ; LYUBASHEVSKIY IGOR ; CAREY JAMES E</creator><creatorcontrib>HOPEMAN ALBERT ; LYUBASHEVSKIY IGOR ; CAREY JAMES E</creatorcontrib><description>A method for translating, in a software paging system, an input key describing a virtual page to the address of the page in main memory, comprises creating, in main memory, a translation buffer which has a plurality of records. Each record has a plurality of cells, each cell having a key field for storing a key or a portion of a key which identifies a page in memory, and each cell having an address field for storing the address of the identified page. If the input key matches a stored key, the address associated with the identified page is retrieved. Otherwise, a paging manager is invoked to establish an address for the input key, and the input key and established address are saved. The least recently used order of memory pages addressed in the dereferenced record is indicated by updating a least recently used cell indicator associated with the dereferenced record. Alternatively, a table having a plurality of entries is created, wherein each entry references a respective hash chain of translation records in a main memory translation buffer. Each translation record has a key field for storing a key identifying a page, and an associated address field for storing the address of the identified page in memory. The records of the hash chain are searched until a translation record is found which has a key value matching the input key.</description><edition>7</edition><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2002</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=20021112&amp;DB=EPODOC&amp;CC=US&amp;NR=6480950B1$$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=20021112&amp;DB=EPODOC&amp;CC=US&amp;NR=6480950B1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>HOPEMAN ALBERT</creatorcontrib><creatorcontrib>LYUBASHEVSKIY IGOR</creatorcontrib><creatorcontrib>CAREY JAMES E</creatorcontrib><title>Software paging system</title><description>A method for translating, in a software paging system, an input key describing a virtual page to the address of the page in main memory, comprises creating, in main memory, a translation buffer which has a plurality of records. Each record has a plurality of cells, each cell having a key field for storing a key or a portion of a key which identifies a page in memory, and each cell having an address field for storing the address of the identified page. If the input key matches a stored key, the address associated with the identified page is retrieved. Otherwise, a paging manager is invoked to establish an address for the input key, and the input key and established address are saved. The least recently used order of memory pages addressed in the dereferenced record is indicated by updating a least recently used cell indicator associated with the dereferenced record. Alternatively, a table having a plurality of entries is created, wherein each entry references a respective hash chain of translation records in a main memory translation buffer. Each translation record has a key field for storing a key identifying a page, and an associated address field for storing the address of the identified page in memory. The records of the hash chain are searched until a translation record is found which has a key value matching the input key.</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>2002</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZBALzk8rKU8sSlUoSEzPzEtXKK4sLknN5WFgTUvMKU7lhdLcDApuriHOHrqpBfnxqcUFicmpeakl8aHBZiYWBpamBk6GxkQoAQBzRyFz</recordid><startdate>20021112</startdate><enddate>20021112</enddate><creator>HOPEMAN ALBERT</creator><creator>LYUBASHEVSKIY IGOR</creator><creator>CAREY JAMES E</creator><scope>EVB</scope></search><sort><creationdate>20021112</creationdate><title>Software paging system</title><author>HOPEMAN ALBERT ; LYUBASHEVSKIY IGOR ; CAREY JAMES E</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US6480950B13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2002</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>HOPEMAN ALBERT</creatorcontrib><creatorcontrib>LYUBASHEVSKIY IGOR</creatorcontrib><creatorcontrib>CAREY JAMES E</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>HOPEMAN ALBERT</au><au>LYUBASHEVSKIY IGOR</au><au>CAREY JAMES E</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Software paging system</title><date>2002-11-12</date><risdate>2002</risdate><abstract>A method for translating, in a software paging system, an input key describing a virtual page to the address of the page in main memory, comprises creating, in main memory, a translation buffer which has a plurality of records. Each record has a plurality of cells, each cell having a key field for storing a key or a portion of a key which identifies a page in memory, and each cell having an address field for storing the address of the identified page. If the input key matches a stored key, the address associated with the identified page is retrieved. Otherwise, a paging manager is invoked to establish an address for the input key, and the input key and established address are saved. The least recently used order of memory pages addressed in the dereferenced record is indicated by updating a least recently used cell indicator associated with the dereferenced record. Alternatively, a table having a plurality of entries is created, wherein each entry references a respective hash chain of translation records in a main memory translation buffer. Each translation record has a key field for storing a key identifying a page, and an associated address field for storing the address of the identified page in memory. The records of the hash chain are searched until a translation record is found which has a key value matching the input key.</abstract><edition>7</edition><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US6480950B1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Software paging system
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T11%3A03%3A04IST&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=HOPEMAN%20ALBERT&rft.date=2002-11-12&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS6480950B1%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