ADDRESS RANGE PRIORITY MECHANISM

Method and apparatus to efficiently manage data in caches. Data in caches may be managed based on priorities assigned to the data. Data may be requested by a process using a virtual address of the data. The requested data may be assigned a priority by a component in a computer system called an addre...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	SUBRAMANIAM SAMANTIKA, STEELY, JR. SIMON, HASENPLAUGH WILLIAM C
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
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	SUBRAMANIAM SAMANTIKA STEELY, JR. SIMON HASENPLAUGH WILLIAM C
description	Method and apparatus to efficiently manage data in caches. Data in caches may be managed based on priorities assigned to the data. Data may be requested by a process using a virtual address of the data. The requested data may be assigned a priority by a component in a computer system called an address range priority assigner (ARP). The ARP may assign a particular priority to the requested data if the virtual address of the requested data is within a particular range of virtual addresses. The particular priority assigned may be high priority and the particular range of virtual addresses may be smaller than a cache's capacity.
format	Patent
fullrecord	<record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2013339621A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2013339621A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2013339621A13</originalsourceid><addsrcrecordid>eNrjZFBwdHEJcg0OVghy9HN3VQgI8vQP8gyJVPB1dfZw9PMM9uVhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhsbGxpZmRoaOhsbEqQIAgeci4Q</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ADDRESS RANGE PRIORITY MECHANISM</title><source>esp@cenet</source><creator>SUBRAMANIAM SAMANTIKA ; STEELY, JR. SIMON ; HASENPLAUGH WILLIAM C</creator><creatorcontrib>SUBRAMANIAM SAMANTIKA ; STEELY, JR. SIMON ; HASENPLAUGH WILLIAM C</creatorcontrib><description>Method and apparatus to efficiently manage data in caches. Data in caches may be managed based on priorities assigned to the data. Data may be requested by a process using a virtual address of the data. The requested data may be assigned a priority by a component in a computer system called an address range priority assigner (ARP). The ARP may assign a particular priority to the requested data if the virtual address of the requested data is within a particular range of virtual addresses. The particular priority assigned may be high priority and the particular range of virtual addresses may be smaller than a cache's capacity.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2013</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&date=20131219&DB=EPODOC&CC=US&NR=2013339621A1$$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&date=20131219&DB=EPODOC&CC=US&NR=2013339621A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SUBRAMANIAM SAMANTIKA</creatorcontrib><creatorcontrib>STEELY, JR. SIMON</creatorcontrib><creatorcontrib>HASENPLAUGH WILLIAM C</creatorcontrib><title>ADDRESS RANGE PRIORITY MECHANISM</title><description>Method and apparatus to efficiently manage data in caches. Data in caches may be managed based on priorities assigned to the data. Data may be requested by a process using a virtual address of the data. The requested data may be assigned a priority by a component in a computer system called an address range priority assigner (ARP). The ARP may assign a particular priority to the requested data if the virtual address of the requested data is within a particular range of virtual addresses. The particular priority assigned may be high priority and the particular range of virtual addresses may be smaller than a cache's capacity.</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>2013</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFBwdHEJcg0OVghy9HN3VQgI8vQP8gyJVPB1dfZw9PMM9uVhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhsbGxpZmRoaOhsbEqQIAgeci4Q</recordid><startdate>20131219</startdate><enddate>20131219</enddate><creator>SUBRAMANIAM SAMANTIKA</creator><creator>STEELY, JR. SIMON</creator><creator>HASENPLAUGH WILLIAM C</creator><scope>EVB</scope></search><sort><creationdate>20131219</creationdate><title>ADDRESS RANGE PRIORITY MECHANISM</title><author>SUBRAMANIAM SAMANTIKA ; STEELY, JR. SIMON ; HASENPLAUGH WILLIAM C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2013339621A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2013</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>SUBRAMANIAM SAMANTIKA</creatorcontrib><creatorcontrib>STEELY, JR. SIMON</creatorcontrib><creatorcontrib>HASENPLAUGH WILLIAM C</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SUBRAMANIAM SAMANTIKA</au><au>STEELY, JR. SIMON</au><au>HASENPLAUGH WILLIAM C</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ADDRESS RANGE PRIORITY MECHANISM</title><date>2013-12-19</date><risdate>2013</risdate><abstract>Method and apparatus to efficiently manage data in caches. Data in caches may be managed based on priorities assigned to the data. Data may be requested by a process using a virtual address of the data. The requested data may be assigned a priority by a component in a computer system called an address range priority assigner (ARP). The ARP may assign a particular priority to the requested data if the virtual address of the requested data is within a particular range of virtual addresses. The particular priority assigned may be high priority and the particular range of virtual addresses may be smaller than a cache's capacity.</abstract><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier
ispartof
issn
language	eng
recordid	cdi_epo_espacenet_US2013339621A1
source	esp@cenet
subjects	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
title	ADDRESS RANGE PRIORITY MECHANISM
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T09%3A49%3A41IST&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=SUBRAMANIAM%20SAMANTIKA&rft.date=2013-12-19&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2013339621A1%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