메뉴 건너뛰기




Volumn , Issue , 2008, Pages 25-36

A two-level load/store queue based on execution locality

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS.; INSTRUCTION WINDOWS; INTERNATIONAL SYMPOSIUM; LOAD STORE QUEUE; LOW POWERS; MULTI-CORE PROCESSORS; NEW DESIGN; OUT-OF-ORDER; PROCESSOR DESIGNS; SEQUENTIAL ALGORITHMS; THREAD-LEVEL PARALLELISM; WINDOW ENVIRONMENT;

EID: 52649144422     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCA.2008.10     Document Type: Conference Paper
Times cited : (10)

References (25)
  • 3
    • 84944392430 scopus 로고    scopus 로고
    • Checkpoint processing and recovery: Towards scalable large instruction window processors
    • H. Akkary, R. Rajwar, and S. T. Srinivasan, "Checkpoint processing and recovery: Towards scalable large instruction window processors," in MlCRO-36, 2003.
    • (2003) MlCRO-36
    • Akkary, H.1    Rajwar, R.2    Srinivasan, S.T.3
  • 9
    • 4644289583 scopus 로고    scopus 로고
    • Memory ordering: A value-based approach
    • June
    • H. W. Cain and M. H. Lipasti, "Memory ordering: A value-based approach," in ISCA-31, June 2004.
    • (2004) ISCA-31
    • Cain, H.W.1    Lipasti, M.H.2
  • 10
    • 27544514377 scopus 로고    scopus 로고
    • Store Vulnerability Window (SVW): Re-Execution Filtering for Enhanced Load Optimization
    • June
    • A. Roth, "Store Vulnerability Window (SVW): Re-Execution Filtering for Enhanced Load Optimization," in ISCA-32, June 2005.
    • (2005) ISCA-32
    • Roth, A.1
  • 12
    • 0030129806 scopus 로고    scopus 로고
    • The MIPS R10000 superscalar microprocessor
    • Apr
    • K. C. Yeager, "The MIPS R10000 superscalar microprocessor," IEEE Micro, vol. 16, pp. 28-41, Apr. 1996.
    • (1996) IEEE Micro , vol.16 , pp. 28-41
    • Yeager, K.C.1
  • 13
    • 0014814325 scopus 로고
    • Space/Time trade-offs in hash coding with allowable errors
    • July
    • B. H. Bloom, "Space/Time trade-offs in hash coding with allowable errors," Communications of the ACM, vol, 13(7), pp. 422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 14
    • 52949114554 scopus 로고    scopus 로고
    • A 4.6Tbits/s 3.6GHz Single-cycle NoC Router with a Novel Switch Allocator in 65nm CMOS
    • October
    • A. Kumar, P. Kundu, A. P. Singh, L.-S. Peh, and N. K. Jha, "A 4.6Tbits/s 3.6GHz Single-cycle NoC Router with a Novel Switch Allocator in 65nm CMOS," ICCD-2007, October 2007.
    • (2007) ICCD-2007
    • Kumar, A.1    Kundu, P.2    Singh, A.P.3    Peh, L.-S.4    Jha, N.K.5
  • 15
    • 0007997616 scopus 로고    scopus 로고
    • ARB: A Hardware Mechanism for Dynamic Reordering of Memory References
    • May
    • M. Franklin and G. S. Sohi, "ARB: A Hardware Mechanism for Dynamic Reordering of Memory References," IEEE Transactions on Computers, vol. 45, pp. 552-571, May 1996.
    • (1996) IEEE Transactions on Computers , vol.45 , pp. 552-571
    • Franklin, M.1    Sohi, G.S.2
  • 18
    • 0023795996 scopus 로고
    • An Evaluation of Directory Schemes for Cache Coherence
    • May-June
    • A. Agarwal, R. Simoni, J. Hennessy, and M. Horowitz, "An Evaluation of Directory Schemes for Cache Coherence," in ISCA-15, May-June 1988, pp. 280-289.
    • (1988) ISCA-15 , pp. 280-289
    • Agarwal, A.1    Simoni, R.2    Hennessy, J.3    Horowitz, M.4
  • 20
    • 84944398264 scopus 로고    scopus 로고
    • Reducing design, complexity of the load/store queue
    • I. Park, C. L. Ooi, and T. N. Vijaykumar, "Reducing design, complexity of the load/store queue," in MICRO-36, 2003.
    • (2003) MICRO-36
    • Park, I.1    Ooi, C.L.2    Vijaykumar, T.N.3
  • 21
    • 0031594025 scopus 로고    scopus 로고
    • Memory Dependence prediction using store sets
    • June
    • G. Z. Chrysos and. J. S. Emer, "Memory Dependence prediction using store sets," in ISCA-25, June 1998, pp. 142-153.
    • (1998) ISCA-25 , pp. 142-153
    • Chrysos, G.Z.1    Emer, J.S.2
  • 23
    • 27544453565 scopus 로고    scopus 로고
    • Streamlining Inter-operation Memory Communication via Data Dependence Prediction
    • December
    • A. Moshovos and G. S. Sohi, "Streamlining Inter-operation Memory Communication via Data Dependence Prediction," in MICRO-30, December 1997.
    • (1997) MICRO-30
    • Moshovos, A.1    Sohi, G.S.2
  • 24
    • 40349106434 scopus 로고    scopus 로고
    • Fire-and-Forget: Load/Store Scheduling with No Store Queue at All
    • December
    • S. Subramaniam and G. H. Loh, "Fire-and-Forget: Load/Store Scheduling with No Store Queue at All," in MICRO-39, December 2006.
    • (2006) MICRO-39
    • Subramaniam, S.1    Loh, G.H.2
  • 25
    • 34249810603 scopus 로고    scopus 로고
    • NoSQ: Store-Load Communication without a Store Queue
    • December
    • T. Sha, M. Martin, and A. Roth, "NoSQ: Store-Load Communication without a Store Queue," in MICRO-39, December 2006.
    • (2006) MICRO-39
    • Sha, T.1    Martin, M.2    Roth, A.3


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