메뉴 건너뛰기




Volumn , Issue , 2013, Pages 639-650

MISE: Providing performance predictability and improving fairness in shared main memory systems

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION SCHEMES; MAIN MEMORY; MULTI-CORE SYSTEMS; PERFORMANCE DEGRADATION;

EID: 84880311561     PISSN: 15300897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCA.2013.6522356     Document Type: Conference Paper
Times cited : (156)

References (37)
  • 1
    • 84880287263 scopus 로고    scopus 로고
    • SPEC CPU2006. http://www.spec.org/spec2006.
    • (2006) CPU
  • 2
    • 84864843567 scopus 로고    scopus 로고
    • Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems
    • R. Ausavarungnirun et al. Staged memory scheduling: Achieving high performance and scalability in heterogeneous systems. In ISCA, 2012.
    • (2012) ISCA
    • Ausavarungnirun, R.1
  • 3
    • 84880294045 scopus 로고    scopus 로고
    • Predictable performance in SMT processors: Synergy between the OS and SMTs
    • Jul.
    • F. J. Cazorla et al. Predictable performance in SMT processors: Synergy between the OS and SMTs. IEEE TC, Jul. 2006.
    • (2006) IEEE TC
    • Cazorla, F.J.1
  • 4
    • 76749124429 scopus 로고    scopus 로고
    • Application-aware prioritization mechanisms for on-chip networks
    • R. Das et al. Application-aware prioritization mechanisms for on-chip networks. In MICRO, 2009.
    • (2009) MICRO
    • Das, R.1
  • 5
    • 84880312849 scopus 로고    scopus 로고
    • Per-thread cycle accounting in multicore processors
    • K. Du Bois et al. Per-thread cycle accounting in multicore processors. In HiPEAC, 2013.
    • (2013) HiPEAC
    • Du Bois, K.1
  • 6
    • 77952285828 scopus 로고    scopus 로고
    • Fairness via source throttling: A configurable and highperformance fairness substrate for multi-core memory systems
    • E. Ebrahimi et al. Fairness via source throttling: A configurable and highperformance fairness substrate for multi-core memory systems. In ASPLOS, 2010.
    • (2010) ASPLOS
    • Ebrahimi, E.1
  • 7
    • 84880252642 scopus 로고    scopus 로고
    • Parallel application memory scheduling
    • E. Ebrahimi et al. Parallel application memory scheduling. In MICRO, 201l.
    • MICRO, 201l
    • Ebrahimi, E.1
  • 8
    • 67650091396 scopus 로고    scopus 로고
    • Per-thread cycle accounting in SMT processors
    • S. Eyerman and L. Eeckhout. Per-thread cycle accounting in SMT processors. In ASPLOS, 2009.
    • (2009) ASPLOS
    • Eyerman, S.1    Eeckhout, L.2
  • 9
    • 34249813667 scopus 로고    scopus 로고
    • A performance counter architecture for computing accurate CPI components
    • S. Eyerman et al. A performance counter architecture for computing accurate CPI components. In ASPLOS, 2006.
    • (2006) ASPLOS
    • Eyerman, S.1
  • 10
    • 84880305706 scopus 로고    scopus 로고
    • A mechanistic performance model for superscalar outof-order processors
    • May
    • S. Eyerman et al. A mechanistic performance model for superscalar outof-order processors. ACM TOCS, May 2009.
    • (2009) ACM TOCS
    • Eyerman, S.1
  • 11
    • 70449711364 scopus 로고    scopus 로고
    • Rate-based QoS techniques for cache/memory in CMP platforms
    • A. Herdrich et al. Rate-based QoS techniques for cache/memory in CMP platforms. In ICS, 2009.
    • (2009) ICS
    • Herdrich, A.1
  • 13
    • 52649148744 scopus 로고    scopus 로고
    • SeIf-optimizing memory controllers: A reinforcement learning approach
    • E. Ipek et al. SeIf-optimizing memory controllers: A reinforcement learning approach. In ISCA, 2008.
    • (2008) ISCA
    • Ipek., E.1
  • 14
    • 8344246922 scopus 로고    scopus 로고
    • CQoS: A framework for enabling QoS in shared caches of CMP platforms
    • R. Iyer. CQoS: A framework for enabling QoS in shared caches of CMP platforms. In ICS, 2004.
    • (2004) ICS
    • Iyer, R.1
  • 15
    • 47349095214 scopus 로고    scopus 로고
    • QoS policies and architecture for cache/memory in CMP platforms
    • R. Iyer et al. QoS policies and architecture for cache/memory in CMP platforms. In SIGMETRlCS, 2007.
    • (2007) SIGMETRlCS
    • Iyer, R.1
  • 16
    • 84860328391 scopus 로고    scopus 로고
    • Balancing DRAM locality and parallelism in shared memory CMP systems
    • M. K. Jeong et al. Balancing DRAM locality and parallelism in shared memory CMP systems. In HPCA, 2012.
    • (2012) HPCA
    • Jeong, M.K.1
  • 17
    • 4644299010 scopus 로고    scopus 로고
    • A first-order superscalar processor model
    • T. S. Karkhanis and J. E. Smith. A first-order superscalar processor model. In ISCA, 2004.
    • (2004) ISCA
    • Karkhanis, T.S.1    Smith, J.E.2
  • 18
    • 84858772659 scopus 로고    scopus 로고
    • Minimalist open-page: A DRAM page-mode scheduling policy for the many-core era
    • D. Kaseridis et al. Minimalist open-page: A DRAM page-mode scheduling policy for the many-core era. In MICRO, 201l.
    • (2011) MICRO
    • Kaseridis, D.1
  • 19
    • 77952558442 scopus 로고    scopus 로고
    • ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers
    • Y. Kim et al. ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers. In HPCA, 2010.
    • (2010) HPCA
    • Kim, Y.1
  • 20
    • 79951718838 scopus 로고    scopus 로고
    • Thread cluster memory scheduling: Exploiting differences in memory access behavior
    • Y. Kim et al. Thread cluster memory scheduling: Exploiting differences in memory access behavior. In MICRO, 2010.
    • (2010) MICRO
    • Kim, Y.1
  • 21
    • 31944440969 scopus 로고    scopus 로고
    • Pin: Building customized program analysis tools with dynamic instrumentation
    • C.-K. Luk et al. Pin: Building customized program analysis tools with dynamic instrumentation. In PLDI, 2005.
    • (2005) PLDI
    • Luk, C.-K.1
  • 22
    • 84962144701 scopus 로고    scopus 로고
    • Balancing thoughput and fairness in SMT processors
    • K. Luo et al. Balancing thoughput and fairness in SMT processors. In ISPASS, 200 l .
    • (2001) ISPASS
    • Luo, K.1
  • 23
    • 84880280059 scopus 로고    scopus 로고
    • CPU accounting i n CMP processors
    • Jan.-Jun.
    • C. Luque e t al. CPU accounting i n CMP processors. IEEE CAL, Jan.-Jun. 2009.
    • (2009) IEEE CAL
    • Luque, C.1
  • 24
    • 84858783719 scopus 로고    scopus 로고
    • Bubble-Up: Increasing utilization in modern warehouse scale computers via sensible co-Iocations
    • J. Mars et al. Bubble-Up: Increasing utilization in modern warehouse scale computers via sensible co-Iocations. In MICRO, 201l.
    • (2011) MICRO
    • Mars, J.1
  • 25
    • 84880268208 scopus 로고    scopus 로고
    • Micron. 4Gb DDR3 SDRAM
    • Micron. 4Gb DDR3 SDRAM.
  • 26
    • 52649128991 scopus 로고    scopus 로고
    • Memory performance attacks: Denial of memory service in multi-core systems
    • T. Moscibroda and O. Mutlu. Memory performance attacks: Denial of memory service in multi-core systems. In USENIX Security, 2007.
    • (2007) USENIX Security
    • Moscibroda, T.1    Mutlu, O.2
  • 27
    • 84858771269 scopus 로고    scopus 로고
    • Reducing memory interference in multicore systems via application-aware memory channel partitioning
    • S. P. Muralidhara et al. Reducing memory interference in multicore systems via application-aware memory channel partitioning. In MICRO, 201l.
    • (2011) MICRO
    • Muralidhara, S.P.1
  • 28
    • 47349122373 scopus 로고    scopus 로고
    • Stall-time fair memory access scheduling for chip multiprocessors
    • O. Mutlu and T. Moscibroda. Stall-time fair memory access scheduling for chip multiprocessors. In MICRO, 2007.
    • (2007) MICRO
    • Mutlu, O.1    Moscibroda, T.2
  • 29
    • 52649119398 scopus 로고    scopus 로고
    • Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems
    • O. Mutlu and T. Moscibroda. Parallelism-aware batch scheduling: Enhancing both performance and fairness of shared DRAM systems. In ISCA, 2008.
    • (2008) ISCA
    • Mutlu, O.1    Moscibroda, T.2
  • 30
    • 34548050337 scopus 로고    scopus 로고
    • Fair queuing memory systems
    • K. J. Nesbit et al. Fair queuing memory systems. In MICRO, 2006.
    • (2006) MICRO
    • Nesbit, K.J.1
  • 31
    • 21644454187 scopus 로고    scopus 로고
    • Pinpointing representative portions of large Intel ltanium programs with dynamic instrumentation
    • H. Patil et al. Pinpointing representative portions of large Intel ltanium programs with dynamic instrumentation. In MICRO-37, 2004.
    • (2004) MICRO-37
    • Patil, H.1
  • 32
    • 85084160584 scopus 로고    scopus 로고
    • Implementing lottery scheduling: Matching the specializations in traditional schedulers
    • D. Petrou et al. Implementing lottery scheduling: Matching the specializations in traditional schedulers. In USENIX ATEC, 1999.
    • (1999) USENIX ATEC
    • Petrou, D.1
  • 33
    • 0033691565 scopus 로고    scopus 로고
    • Memory access scheduling
    • S. Rixner et al. Memory access scheduling. In ISCA, 2000.
    • (2000) ISCA
    • Rixner, S.1
  • 34
    • 0034443570 scopus 로고    scopus 로고
    • Symbiotic jobscheduling for a simultaneous multithreaded processor
    • A. Snavely and D. M. Tullsen. Symbiotic jobscheduling for a simultaneous multithreaded processor. In ASPLOS, 2000.
    • (2000) ASPLOS
    • Snavely, A.1    Tullsen, D.M.2
  • 35
    • 84864863389 scopus 로고    scopus 로고
    • Scheduling heterogeneous multi-cores through performance impact estimation (PIE)
    • K. Van Craeynest et al. Scheduling heterogeneous multi-cores through performance impact estimation (PIE). In ISCA, 2012.
    • (2012) ISCA
    • Van Craeynest, K.1
  • 36
    • 85017201891 scopus 로고
    • Lottery scheduling: Flexible proportional-share resource management
    • C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In OSDI, 1994.
    • (1994) OSDI
    • Waldspurger, C.A.1    Weihl, W.E.2


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