메뉴 건너뛰기




Volumn 61, Issue 11, 2012, Pages 1535-1550

Exploiting core working sets to filter the L1 cache with random sampling

Author keywords

Benchmark testing; cache filtering; cache insertion policy; Core working sets; dual cache design; Educational institutions; Histograms; L1 cache; mass count disparity; Measurement; Power demand; Probabilistic logic; random insertion policy; System performance

Indexed keywords

BENCHMARK TESTING; CACHE FILTERING; EDUCATIONAL INSTITUTIONS; HISTOGRAMS; L1 CACHE; MASS-COUNT DISPARITY; POWER DEMANDS; RANDOM INSERTIONS; SYSTEM PERFORMANCE; WORKING SET;

EID: 84867291675     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2011.197     Document Type: Article
Times cited : (9)

References (34)
  • 1
    • 0036469652 scopus 로고    scopus 로고
    • Simplescalar: An infrastructure for computer system modeling
    • Feb.
    • T. Austin, E. Larson, and D. Ernst, "SimpleScalar: An Infrastructure for Computer System Modeling," Computer, vol. 35, no. 2, pp. 59-67, Feb. 2002.
    • (2002) Computer , vol.35 , Issue.2 , pp. 59-67
    • Austin, T.1    Larson, E.2    Ernst, D.3
  • 3
    • 0003003638 scopus 로고
    • A study of replacement algorithms for a virtual-storage computer
    • L.A. Belady, "A Study of Replacement Algorithms for a Virtual-Storage Computer," IBM Systems J., vol. 5, no. 2, pp. 78-101, 1966.
    • (1966) IBM Systems J. , vol.5 , Issue.2 , pp. 78-101
    • Belady, L.A.1
  • 4
    • 0742303464 scopus 로고    scopus 로고
    • Optimal replacement is np-hard for nonstandard caches
    • Jan.
    • M. Brehob, S. Wagner, E. Torng, and R. Enbody, "Optimal Replacement Is NP-Hard for Nonstandard Caches," IEEE Trans. Computers, vol. 53, no. 1, pp. 73-76, Jan. 2004.
    • (2004) IEEE Trans. Computers , vol.53 , Issue.1 , pp. 73-76
    • Brehob, M.1    Wagner, S.2    Torng, E.3    Enbody, R.4
  • 6
    • 0032686331 scopus 로고    scopus 로고
    • Decoupling local variable accesses in a wide-issue superscalar processor
    • S. Cho, P.C. Yew, and G. Lee, "Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor," Proc. Int'l Symp. Computer Architecture (ISCA), pp. 100-110, 1999.
    • (1999) Proc. Int'l Symp. Computer Architecture (ISCA) , pp. 100-110
    • Cho, S.1    Yew, P.C.2    Lee, G.3
  • 7
    • 79955715200 scopus 로고
    • The working set model for program behavior
    • May
    • P.J. Denning, "The Working Set Model for Program Behavior," Comm. ACM, vol. 11, no. 5, pp. 323-333, May 1968.
    • (1968) Comm. ACM , vol.11 , Issue.5 , pp. 323-333
    • Denning, P.J.1
  • 8
    • 0015316498 scopus 로고
    • Properties of the working-set model
    • Mar.
    • P.J. Denning and S.C. Schwartz, "Properties of the Working-Set Model," Comm. ACM, vol. 15, no. 3, pp. 191-198, Mar. 1972.
    • (1972) Comm. ACM , vol.15 , Issue.3 , pp. 191-198
    • Denning, P.J.1    Schwartz, S.C.2
  • 12
    • 34547625707 scopus 로고    scopus 로고
    • Probabilistic prediction of temporal locality
    • Jan.-June
    • Y. Etsion and D.G. Feitelson, "Probabilistic Prediction of Temporal Locality," IEEE Computer Architecture Letters, vol. 6, no. 1, pp. 17-20, Jan.-June 2007.
    • (2007) IEEE Computer Architecture Letters , vol.6 , Issue.1 , pp. 17-20
    • Etsion, Y.1    Feitelson, D.G.2
  • 17
    • 0025429331 scopus 로고
    • Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
    • N.P. Jouppi, "Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Buffers," Proc. Int'l Symp. Computer Architecture (ISCA), pp. 364-373, 1990.
    • (1990) Proc. Int'l Symp. Computer Architecture (ISCA) , pp. 364-373
    • Jouppi, N.P.1
  • 19
    • 84935761346 scopus 로고
    • Methods of measuring the concentration of wealth
    • June
    • M.O. Lorenz, "Methods of Measuring the Concentration of Wealth," Publications of the Am. Statistical Assoc., vol. 9, no. 70, pp. 209-219, June 1905.
    • (1905) Publications of the Am. Statistical Assoc. , vol.9 , Issue.70 , pp. 209-219
    • Lorenz, M.O.1
  • 22
    • 84867300503 scopus 로고    scopus 로고
    • A Power Efficient Cache Structure for Embedded Processors Based on the Dual Cache Structure
    • G.-H. Park, K.-W. Lee, J.-H. Lee, T.-D. Han, and S.-D. Kim, "A Power Efficient Cache Structure for Embedded Processors Based on the Dual Cache Structure," Proc. Workshop Languages, Compilers, and Tools for Embedded Systems (LCTES), pp. 162-177, 2000. (Pubitemid 33250003)
    • (2001) Lecture Notes In Computer Science , Issue.1985 , pp. 162-177
    • Park, G.-H.1    Lee, K.-W.2    Lee, J.-H.3    Han, T.-D.4    Kim, S.-D.5
  • 26
    • 84948125832 scopus 로고    scopus 로고
    • Reducing conflicts in direct-mapped caches with a temporality-based design
    • J.A. Rivers and E.S. Davidson, "Reducing Conflicts in Direct-Mapped Caches with a Temporality-Based Design," Proc. Int'l Conf. Parallel Processing (ICPP), vol. 1, pp. 154-163, 1996.
    • (1996) Proc. Int'l Conf. Parallel Processing (ICPP) , vol.1 , pp. 154-163
    • Rivers, J.A.1    Davidson, E.S.2
  • 27
    • 0034226522 scopus 로고    scopus 로고
    • Splitting the data cache: A survey
    • July-Sept.
    • J. Sahuquillo and A. Pont, "Splitting the Data Cache: A Survey," IEEE Concurrency, vol. 8, no. 3, pp. 30-35, July-Sept. 2000.
    • (2000) IEEE Concurrency , vol.8 , Issue.3 , pp. 30-35
    • Sahuquillo, J.1    Pont, A.2
  • 29
    • 0020177251 scopus 로고
    • Cache memories
    • A.J. Smith, "Cache Memories," ACM Computing Surveys, vol. 14, no. 3, pp. 473-530, 1982.
    • (1982) ACM Computing Surveys , vol.14 , Issue.3 , pp. 473-530
    • Smith, A.J.1
  • 30
    • 84867287811 scopus 로고    scopus 로고
    • Standard performance evaluation corporation
    • Standard Performance Evaluation Corporation, SPEC2000 Benchmark Suite, http://www.spec.org, 2011.
    • (2011) SPEC2000 Benchmark Suite


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.