完整後設資料紀錄
DC 欄位語言
dc.contributor.authorChen, Hsin-Chuan
dc.date.accessioned2009-06-02T07:05:22Z
dc.date.accessioned2020-05-25T06:48:24Z-
dc.date.available2009-06-02T07:05:22Z
dc.date.available2020-05-25T06:48:24Z-
dc.date.issued2009-02-09T01:58:27Z
dc.date.submitted2009-01-19
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/11114-
dc.description.abstractThe conventional sequential MRU cache has longer access time because the MRU information must be fetched from the MRU table before accessing the memory banks of cache, and incurs larger power consumption due to multiple accesses of memory banks. In this paper, focusing on the sequential MRU cache with sub-block placement, we propose an MRU cache scheme that separates the valid bits from data memory and uses these valid bits to pre-decide reducing the unnecessary access number of memory banks. By this approach, the probability of the front hits is thus increased, and it significantly helps in improving the average access time and average energy dissipation of the sequential MRU cache without valid-bit pre-decision search especially for large associativity and small sub-block size.
dc.description.sponsorship淡江大學,台北縣
dc.format.extent5p.
dc.relation.ispartofseries2008 ICS會議
dc.subjectSequential MRU cache
dc.subjectLow power
dc.subjectSub-block placement
dc.subjectValid-bit pre-decision
dc.subject.otherComputer Architecture
dc.titleLow-Power Sequential MRU Cache Based on Valid-Bit Pre-Decision
分類:2008年 ICS 國際計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ics002008000045.pdf199.14 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。