{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:20:46Z","timestamp":1648887646446},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2007,8]]},"abstract":"<jats:p> Most recently used (MRU) cache is one of the set-associative caches that emphasize implementation of associativity higher than 2. However, the access time is increased because the MRU information must be fetched before accessing the sequential MRU (SMRU) cache. In this paper, focusing on the SMRU cache with subblock placement, we propose an MRU cache scheme that separates the valid bits from data memory and uses these valid bits to decide to reduce 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 of the SMRU cache without valid-bit assistant search especially for large associativity and small subblock size. <\/jats:p>","DOI":"10.1142\/s0218126607003824","type":"journal-article","created":{"date-parts":[[2007,12,11]],"date-time":"2007-12-11T06:08:12Z","timestamp":1197353292000},"page":"613-626","source":"Crossref","is-referenced-by-count":0,"title":["A HIGH-PERFORMANCE SEQUENTIAL MRU CACHE USING VALID-BIT ASSISTANT SEARCH ALGORITHM"],"prefix":"10.1142","volume":"16","author":[{"given":"HSIN-CHUAN","family":"CHEN","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, St. John's University, 499, Sec. 4, Tam-king Road, Tamsui, Taipei 25135, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEN-SHIUN","family":"CHIANG","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Tamkang University, 151, Ying-Chuan Road, Tamsui, Taipei 25137, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/2.16187"},{"key":"rf3","unstructured":"J. L.\u00a0Hennessy and D. A.\u00a0Patterson, Computer Architecture: A Quantitative Approach, 2nd edn. (Morgan Kaufman, San Francisco, 1997)\u00a0pp. 412\u2013413."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/356887.356892"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/48012.48037"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1109\/12.2208"},{"key":"rf10","first-page":"186","volume":"83","author":"Inoue K.","journal-title":"IEICE Trans. Electron."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/40.621212"},{"key":"rf17","unstructured":"J. P.\u00a0Hayes, Computer Architecture and Organization, 2nd edn. (McGraw-Hill, New York, 1988)\u00a0pp. 449\u2013458."}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126607003824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:56:22Z","timestamp":1565186182000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126607003824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,8]]}},"alternative-id":["10.1142\/S0218126607003824"],"URL":"https:\/\/doi.org\/10.1142\/s0218126607003824","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}