Microprocessor cache compressor design using P-Match algorithm
The speed of the microprocessors is being increasing faster than the speed of off-chip memory. When multiprocessors are used in the system design, more number of processors requires added accesses to memory. Accessing off-chip memory takes more time than accessing an on-chip cache, and some more tim...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 5 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Deepa, A. Marimuthu, C. N. |
| description | The speed of the microprocessors is being increasing faster than the speed of off-chip memory. When multiprocessors are used in the system design, more number of processors requires added accesses to memory. Accessing off-chip memory takes more time than accessing an on-chip cache, and some more time to execute an instruction. Cache compression presents the confront that the processor speed has to be improved but it should not substantially increase the total chip power consumption. This architecture has number of new features adapted for the application. In the proposed work if there are consecutive zero's or one's then there patterns are encoded and the dictionary matching is bypassed. By this method the speed and the power can be improved without affecting the performance of the system cache. |
| doi_str_mv | 10.1109/ICCCI.2012.6158885 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6158885</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6158885</ieee_id><sourcerecordid>6158885</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-36a5c3c84fddb0668af17ff7a9592d23982c0afb45e90c958ded689b7ed8d6bd3</originalsourceid><addsrcrecordid>eNo1T81qwzAY8xiFbW1eYLvkBZLZTmx_vgyG2U-gZTv0Xhz_JB5NE-zssLdfRjtdhISQEEL3BJeEYPnYKKWakmJCS04YALArdEdqJsSiKLlGmRTwrzHcoCylL7yA8yUMt-hpF0wcpzgal9IYc6NN73IzDlM8G9al0J3y7xROXf5Z7PRs-lwfuzGGuR82aOX1Mbnswmu0f33Zq_di-_HWqOdtESSei4prZioDtbe2_ZvWngjvhZZMUksrCdRg7duaOYmNZGCd5SBb4SxY3tpqjR7OtcE5d5hiGHT8OVweV7-RyEsB</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Microprocessor cache compressor design using P-Match algorithm</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Deepa, A. ; Marimuthu, C. N.</creator><creatorcontrib>Deepa, A. ; Marimuthu, C. N.</creatorcontrib><description>The speed of the microprocessors is being increasing faster than the speed of off-chip memory. When multiprocessors are used in the system design, more number of processors requires added accesses to memory. Accessing off-chip memory takes more time than accessing an on-chip cache, and some more time to execute an instruction. Cache compression presents the confront that the processor speed has to be improved but it should not substantially increase the total chip power consumption. This architecture has number of new features adapted for the application. In the proposed work if there are consecutive zero's or one's then there patterns are encoded and the dictionary matching is bypassed. By this method the speed and the power can be improved without affecting the performance of the system cache.</description><identifier>ISBN: 9781457715808</identifier><identifier>ISBN: 1457715805</identifier><identifier>EISBN: 1457715821</identifier><identifier>EISBN: 9781457715822</identifier><identifier>EISBN: 9781457715839</identifier><identifier>EISBN: 145771583X</identifier><identifier>DOI: 10.1109/ICCCI.2012.6158885</identifier><language>eng</language><publisher>IEEE</publisher><subject>cachecompression ; Compression algorithms ; compressionratio ; Computer architecture ; Computers ; Dictionaries ; Hardware ; hardware implementation ; pair matching ; Pattern matching ; Pipelines</subject><ispartof>2012 International Conference on Computer Communication and Informatics, 2012, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6158885$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6158885$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Deepa, A.</creatorcontrib><creatorcontrib>Marimuthu, C. N.</creatorcontrib><title>Microprocessor cache compressor design using P-Match algorithm</title><title>2012 International Conference on Computer Communication and Informatics</title><addtitle>ICCCI</addtitle><description>The speed of the microprocessors is being increasing faster than the speed of off-chip memory. When multiprocessors are used in the system design, more number of processors requires added accesses to memory. Accessing off-chip memory takes more time than accessing an on-chip cache, and some more time to execute an instruction. Cache compression presents the confront that the processor speed has to be improved but it should not substantially increase the total chip power consumption. This architecture has number of new features adapted for the application. In the proposed work if there are consecutive zero's or one's then there patterns are encoded and the dictionary matching is bypassed. By this method the speed and the power can be improved without affecting the performance of the system cache.</description><subject>cachecompression</subject><subject>Compression algorithms</subject><subject>compressionratio</subject><subject>Computer architecture</subject><subject>Computers</subject><subject>Dictionaries</subject><subject>Hardware</subject><subject>hardware implementation</subject><subject>pair matching</subject><subject>Pattern matching</subject><subject>Pipelines</subject><isbn>9781457715808</isbn><isbn>1457715805</isbn><isbn>1457715821</isbn><isbn>9781457715822</isbn><isbn>9781457715839</isbn><isbn>145771583X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1T81qwzAY8xiFbW1eYLvkBZLZTmx_vgyG2U-gZTv0Xhz_JB5NE-zssLdfRjtdhISQEEL3BJeEYPnYKKWakmJCS04YALArdEdqJsSiKLlGmRTwrzHcoCylL7yA8yUMt-hpF0wcpzgal9IYc6NN73IzDlM8G9al0J3y7xROXf5Z7PRs-lwfuzGGuR82aOX1Mbnswmu0f33Zq_di-_HWqOdtESSei4prZioDtbe2_ZvWngjvhZZMUksrCdRg7duaOYmNZGCd5SBb4SxY3tpqjR7OtcE5d5hiGHT8OVweV7-RyEsB</recordid><startdate>201201</startdate><enddate>201201</enddate><creator>Deepa, A.</creator><creator>Marimuthu, C. N.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201201</creationdate><title>Microprocessor cache compressor design using P-Match algorithm</title><author>Deepa, A. ; Marimuthu, C. N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-36a5c3c84fddb0668af17ff7a9592d23982c0afb45e90c958ded689b7ed8d6bd3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>cachecompression</topic><topic>Compression algorithms</topic><topic>compressionratio</topic><topic>Computer architecture</topic><topic>Computers</topic><topic>Dictionaries</topic><topic>Hardware</topic><topic>hardware implementation</topic><topic>pair matching</topic><topic>Pattern matching</topic><topic>Pipelines</topic><toplevel>online_resources</toplevel><creatorcontrib>Deepa, A.</creatorcontrib><creatorcontrib>Marimuthu, C. N.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Deepa, A.</au><au>Marimuthu, C. N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Microprocessor cache compressor design using P-Match algorithm</atitle><btitle>2012 International Conference on Computer Communication and Informatics</btitle><stitle>ICCCI</stitle><date>2012-01</date><risdate>2012</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><isbn>9781457715808</isbn><isbn>1457715805</isbn><eisbn>1457715821</eisbn><eisbn>9781457715822</eisbn><eisbn>9781457715839</eisbn><eisbn>145771583X</eisbn><abstract>The speed of the microprocessors is being increasing faster than the speed of off-chip memory. When multiprocessors are used in the system design, more number of processors requires added accesses to memory. Accessing off-chip memory takes more time than accessing an on-chip cache, and some more time to execute an instruction. Cache compression presents the confront that the processor speed has to be improved but it should not substantially increase the total chip power consumption. This architecture has number of new features adapted for the application. In the proposed work if there are consecutive zero's or one's then there patterns are encoded and the dictionary matching is bypassed. By this method the speed and the power can be improved without affecting the performance of the system cache.</abstract><pub>IEEE</pub><doi>10.1109/ICCCI.2012.6158885</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781457715808 |
| ispartof | 2012 International Conference on Computer Communication and Informatics, 2012, p.1-5 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6158885 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | cachecompression Compression algorithms compressionratio Computer architecture Computers Dictionaries Hardware hardware implementation pair matching Pattern matching Pipelines |
| title | Microprocessor cache compressor design using P-Match algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T19%3A38%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Microprocessor%20cache%20compressor%20design%20using%20P-Match%20algorithm&rft.btitle=2012%20International%20Conference%20on%20Computer%20Communication%20and%20Informatics&rft.au=Deepa,%20A.&rft.date=2012-01&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.isbn=9781457715808&rft.isbn_list=1457715805&rft_id=info:doi/10.1109/ICCCI.2012.6158885&rft_dat=%3Cieee_6IE%3E6158885%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457715821&rft.eisbn_list=9781457715822&rft.eisbn_list=9781457715839&rft.eisbn_list=145771583X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6158885&rfr_iscdi=true |