Advanced High-Level Cache Management by Processor Access Information
In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1 VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy,...
Gespeichert in:
Veröffentlicht in: | Journal of Information Science and Engineering 2006-01, Vol.22 (1), p.215-227 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 227 |
---|---|
container_issue | 1 |
container_start_page | 215 |
container_title | Journal of Information Science and Engineering |
container_volume | 22 |
creator | 郭鍾旭(Jong Wook Kwak) 金哲弘(Cheol Hong Kim) 沈聖勳(Sunghoon Shim) 全洲植(Chu Shik Jhon) |
description | In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1 VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy, conflicted lines in the L1 cache are placed selectively in the victim cache or the level 2 (L2) cache based on previous memory access patterns. In this manner, the L1VPAI policy can make the frequently used address of cache locations reside longer in the high-level caches. We simulate our policy with RSIM, the event-driven simulator, and analyze the simulation results. The simulation results show that the average execution time of the L1VPAI outperforms the simple victim cache (L1V) by up to 6.44%. Moreover, performance gain is expected to increase, in the case of multiprocessor systems. |
doi_str_mv | 10.6688/JISE.2006.22.1.13 |
format | Article |
fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_proquest_miscellaneous_29962954</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><airiti_id>10162364_200601_22_1_215_227_a</airiti_id><sourcerecordid>29962954</sourcerecordid><originalsourceid>FETCH-LOGICAL-a262t-7ad4d1b3d6645ab07f17520e39d7206435eaf62c5cab96ebb9881ae5d58dd1293</originalsourceid><addsrcrecordid>eNotkD1PwzAURT2ARCn8ALYssCX4I3bisSqFFhWBBMzWi-20rhKn2Gml_nsStct7dzi60j0IPRCcCVGWz--r70VGMRYZpRnJCLtCE4KJSCkT-Q26jXGHMRU8zyfoZWaO4LU1ydJttunaHm2TzEFvbfIBHja2tb5PqlPyFTptY-xCMtNjSFa-7kILvev8HbquoYn2_vKn6Pd18TNfpuvPt9V8tk6BCtqnBZjckIoZIXIOFS5qUnCKLZOmoFjkjFuoBdVcQyWFrSpZlgQsN7w0hlDJpujp3LsP3d_Bxl61LmrbNOBtd4iKSimo5PkAPl5AiBqaOgwTXVT74FoIJ0UKJgUTxcDxMwcuuN6pXXcIfligRl2jLTVqxERRqoZD-BAKBewfZIZo8g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29962954</pqid></control><display><type>article</type><title>Advanced High-Level Cache Management by Processor Access Information</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>郭鍾旭(Jong Wook Kwak) ; 金哲弘(Cheol Hong Kim) ; 沈聖勳(Sunghoon Shim) ; 全洲植(Chu Shik Jhon)</creator><creatorcontrib>郭鍾旭(Jong Wook Kwak) ; 金哲弘(Cheol Hong Kim) ; 沈聖勳(Sunghoon Shim) ; 全洲植(Chu Shik Jhon)</creatorcontrib><description>In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1 VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy, conflicted lines in the L1 cache are placed selectively in the victim cache or the level 2 (L2) cache based on previous memory access patterns. In this manner, the L1VPAI policy can make the frequently used address of cache locations reside longer in the high-level caches. We simulate our policy with RSIM, the event-driven simulator, and analyze the simulation results. The simulation results show that the average execution time of the L1VPAI outperforms the simple victim cache (L1V) by up to 6.44%. Moreover, performance gain is expected to increase, in the case of multiprocessor systems.</description><identifier>ISSN: 1016-2364</identifier><identifier>DOI: 10.6688/JISE.2006.22.1.13</identifier><language>eng</language><publisher>Taipei: 社團法人中華民國計算語言學學會</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Information systems. Data bases ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Software</subject><ispartof>Journal of Information Science and Engineering, 2006-01, Vol.22 (1), p.215-227</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17396367$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>郭鍾旭(Jong Wook Kwak)</creatorcontrib><creatorcontrib>金哲弘(Cheol Hong Kim)</creatorcontrib><creatorcontrib>沈聖勳(Sunghoon Shim)</creatorcontrib><creatorcontrib>全洲植(Chu Shik Jhon)</creatorcontrib><title>Advanced High-Level Cache Management by Processor Access Information</title><title>Journal of Information Science and Engineering</title><description>In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1 VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy, conflicted lines in the L1 cache are placed selectively in the victim cache or the level 2 (L2) cache based on previous memory access patterns. In this manner, the L1VPAI policy can make the frequently used address of cache locations reside longer in the high-level caches. We simulate our policy with RSIM, the event-driven simulator, and analyze the simulation results. The simulation results show that the average execution time of the L1VPAI outperforms the simple victim cache (L1V) by up to 6.44%. Moreover, performance gain is expected to increase, in the case of multiprocessor systems.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>1016-2364</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNotkD1PwzAURT2ARCn8ALYssCX4I3bisSqFFhWBBMzWi-20rhKn2Gml_nsStct7dzi60j0IPRCcCVGWz--r70VGMRYZpRnJCLtCE4KJSCkT-Q26jXGHMRU8zyfoZWaO4LU1ydJttunaHm2TzEFvbfIBHja2tb5PqlPyFTptY-xCMtNjSFa-7kILvev8HbquoYn2_vKn6Pd18TNfpuvPt9V8tk6BCtqnBZjckIoZIXIOFS5qUnCKLZOmoFjkjFuoBdVcQyWFrSpZlgQsN7w0hlDJpujp3LsP3d_Bxl61LmrbNOBtd4iKSimo5PkAPl5AiBqaOgwTXVT74FoIJ0UKJgUTxcDxMwcuuN6pXXcIfligRl2jLTVqxERRqoZD-BAKBewfZIZo8g</recordid><startdate>20060101</startdate><enddate>20060101</enddate><creator>郭鍾旭(Jong Wook Kwak)</creator><creator>金哲弘(Cheol Hong Kim)</creator><creator>沈聖勳(Sunghoon Shim)</creator><creator>全洲植(Chu Shik Jhon)</creator><general>社團法人中華民國計算語言學學會</general><general>Institute of Information Science, Academia sinica</general><scope>188</scope><scope>IQODW</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20060101</creationdate><title>Advanced High-Level Cache Management by Processor Access Information</title><author>郭鍾旭(Jong Wook Kwak) ; 金哲弘(Cheol Hong Kim) ; 沈聖勳(Sunghoon Shim) ; 全洲植(Chu Shik Jhon)</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a262t-7ad4d1b3d6645ab07f17520e39d7206435eaf62c5cab96ebb9881ae5d58dd1293</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>online_resources</toplevel><creatorcontrib>郭鍾旭(Jong Wook Kwak)</creatorcontrib><creatorcontrib>金哲弘(Cheol Hong Kim)</creatorcontrib><creatorcontrib>沈聖勳(Sunghoon Shim)</creatorcontrib><creatorcontrib>全洲植(Chu Shik Jhon)</creatorcontrib><collection>Airiti Library</collection><collection>Pascal-Francis</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of Information Science and Engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>郭鍾旭(Jong Wook Kwak)</au><au>金哲弘(Cheol Hong Kim)</au><au>沈聖勳(Sunghoon Shim)</au><au>全洲植(Chu Shik Jhon)</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Advanced High-Level Cache Management by Processor Access Information</atitle><jtitle>Journal of Information Science and Engineering</jtitle><date>2006-01-01</date><risdate>2006</risdate><volume>22</volume><issue>1</issue><spage>215</spage><epage>227</epage><pages>215-227</pages><issn>1016-2364</issn><abstract>In this paper, we propose an advanced high-level cache management policy based on the processor access information, named as L1VPAI (L1 plus Victim cache with Processor Access Information). The L1 VPAI is a cache replacement policy that uses the frequency of the specific cache line. In this policy, conflicted lines in the L1 cache are placed selectively in the victim cache or the level 2 (L2) cache based on previous memory access patterns. In this manner, the L1VPAI policy can make the frequently used address of cache locations reside longer in the high-level caches. We simulate our policy with RSIM, the event-driven simulator, and analyze the simulation results. The simulation results show that the average execution time of the L1VPAI outperforms the simple victim cache (L1V) by up to 6.44%. Moreover, performance gain is expected to increase, in the case of multiprocessor systems.</abstract><cop>Taipei</cop><pub>社團法人中華民國計算語言學學會</pub><doi>10.6688/JISE.2006.22.1.13</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1016-2364 |
ispartof | Journal of Information Science and Engineering, 2006-01, Vol.22 (1), p.215-227 |
issn | 1016-2364 |
language | eng |
recordid | cdi_proquest_miscellaneous_29962954 |
source | EZB-FREE-00999 freely available EZB journals |
subjects | Applied sciences Computer science control theory systems Exact sciences and technology Information systems. Data bases Memory and file management (including protection and security) Memory organisation. Data processing Software |
title | Advanced High-Level Cache Management by Processor Access Information |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T06%3A51%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Advanced%20High-Level%20Cache%20Management%20by%20Processor%20Access%20Information&rft.jtitle=Journal%20of%20Information%20Science%20and%20Engineering&rft.au=%E9%83%AD%E9%8D%BE%E6%97%AD(Jong%20Wook%20Kwak)&rft.date=2006-01-01&rft.volume=22&rft.issue=1&rft.spage=215&rft.epage=227&rft.pages=215-227&rft.issn=1016-2364&rft_id=info:doi/10.6688/JISE.2006.22.1.13&rft_dat=%3Cproquest_pasca%3E29962954%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29962954&rft_id=info:pmid/&rft_airiti_id=10162364_200601_22_1_215_227_a&rfr_iscdi=true |