CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY

Words of data are maintained in content-addressable memory cells arranged in rows. Two of the rows are timing reference rows, and the remainder of the rows are data rows that maintain the words of data. The data rows form individual matchlines. A first of the reference rows forms a precharge referen...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Arsovski Igor, Fragano Michael T, Maffitt Thomas M, Houle Robert M
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 Arsovski Igor
Fragano Michael T
Maffitt Thomas M
Houle Robert M
description Words of data are maintained in content-addressable memory cells arranged in rows. Two of the rows are timing reference rows, and the remainder of the rows are data rows that maintain the words of data. The data rows form individual matchlines. A first of the reference rows forms a precharge reference matchline, and a second of the reference rows forms an evaluation reference matchline. The timing for the individual matchlines to precharge is based on the time to precharge the precharge reference matchline, and timing for the individual matchlines to evaluate a search word is based on the time for the evaluation reference matchline to evaluate the search word.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2017200500A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2017200500A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2017200500A13</originalsourceid><addsrcrecordid>eNrjZAh09vcLcfUL0XV0cQlyDQ52dPJxVfB19fUPilTwcAzz9HNX8A31CfEMAAoHubq5Brn6OQMVOIY4e_h4-rkGK4T4A8VdQoGCPo5Ag5wjeRhY0xJzilN5oTQ3g7KbK1C5bmpBfnxqcUFicmpeakl8aLCRgaG5kYGBqYGBo6ExcaoAe6wwVA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY</title><source>esp@cenet</source><creator>Arsovski Igor ; Fragano Michael T ; Maffitt Thomas M ; Houle Robert M</creator><creatorcontrib>Arsovski Igor ; Fragano Michael T ; Maffitt Thomas M ; Houle Robert M</creatorcontrib><description>Words of data are maintained in content-addressable memory cells arranged in rows. Two of the rows are timing reference rows, and the remainder of the rows are data rows that maintain the words of data. The data rows form individual matchlines. A first of the reference rows forms a precharge reference matchline, and a second of the reference rows forms an evaluation reference matchline. The timing for the individual matchlines to precharge is based on the time to precharge the precharge reference matchline, and timing for the individual matchlines to evaluate a search word is based on the time for the evaluation reference matchline to evaluate the search word.</description><language>eng</language><subject>INFORMATION STORAGE ; PHYSICS ; STATIC STORES</subject><creationdate>2017</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=20170713&amp;DB=EPODOC&amp;CC=US&amp;NR=2017200500A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20170713&amp;DB=EPODOC&amp;CC=US&amp;NR=2017200500A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Arsovski Igor</creatorcontrib><creatorcontrib>Fragano Michael T</creatorcontrib><creatorcontrib>Maffitt Thomas M</creatorcontrib><creatorcontrib>Houle Robert M</creatorcontrib><title>CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY</title><description>Words of data are maintained in content-addressable memory cells arranged in rows. Two of the rows are timing reference rows, and the remainder of the rows are data rows that maintain the words of data. The data rows form individual matchlines. A first of the reference rows forms a precharge reference matchline, and a second of the reference rows forms an evaluation reference matchline. The timing for the individual matchlines to precharge is based on the time to precharge the precharge reference matchline, and timing for the individual matchlines to evaluate a search word is based on the time for the evaluation reference matchline to evaluate the search word.</description><subject>INFORMATION STORAGE</subject><subject>PHYSICS</subject><subject>STATIC STORES</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2017</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZAh09vcLcfUL0XV0cQlyDQ52dPJxVfB19fUPilTwcAzz9HNX8A31CfEMAAoHubq5Brn6OQMVOIY4e_h4-rkGK4T4A8VdQoGCPo5Ag5wjeRhY0xJzilN5oTQ3g7KbK1C5bmpBfnxqcUFicmpeakl8aLCRgaG5kYGBqYGBo6ExcaoAe6wwVA</recordid><startdate>20170713</startdate><enddate>20170713</enddate><creator>Arsovski Igor</creator><creator>Fragano Michael T</creator><creator>Maffitt Thomas M</creator><creator>Houle Robert M</creator><scope>EVB</scope></search><sort><creationdate>20170713</creationdate><title>CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY</title><author>Arsovski Igor ; Fragano Michael T ; Maffitt Thomas M ; Houle Robert M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2017200500A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2017</creationdate><topic>INFORMATION STORAGE</topic><topic>PHYSICS</topic><topic>STATIC STORES</topic><toplevel>online_resources</toplevel><creatorcontrib>Arsovski Igor</creatorcontrib><creatorcontrib>Fragano Michael T</creatorcontrib><creatorcontrib>Maffitt Thomas M</creatorcontrib><creatorcontrib>Houle Robert M</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Arsovski Igor</au><au>Fragano Michael T</au><au>Maffitt Thomas M</au><au>Houle Robert M</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY</title><date>2017-07-13</date><risdate>2017</risdate><abstract>Words of data are maintained in content-addressable memory cells arranged in rows. Two of the rows are timing reference rows, and the remainder of the rows are data rows that maintain the words of data. The data rows form individual matchlines. A first of the reference rows forms a precharge reference matchline, and a second of the reference rows forms an evaluation reference matchline. The timing for the individual matchlines to precharge is based on the time to precharge the precharge reference matchline, and timing for the individual matchlines to evaluate a search word is based on the time for the evaluation reference matchline to evaluate the search word.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2017200500A1
source esp@cenet
subjects INFORMATION STORAGE
PHYSICS
STATIC STORES
title CONTENT-ADDRESSABLE MEMORY HAVING MULTIPLE REFERENCE MATCHLINES TO REDUCE LATENCY
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T07%3A10%3A29IST&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=Arsovski%20Igor&rft.date=2017-07-13&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2017200500A1%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