A spatially triggered dissipative resource distribution policy for SMT processors

被引:1
|
作者
Chen, Hong-zhou [1 ]
Pan, Xue-zeng [1 ]
Ping, Ling-di [1 ]
Lu, Kui-jun [1 ]
Chen, Xiao-ping [1 ]
机构
[1] Zhejiang Univ, Sch Comp Sci & Technol, Hangzhou 310027, Peoples R China
来源
关键词
simultaneous multithreading (SMT); resource distribution; dynamic optimization; dissipative structures;
D O I
10.1631/jzus.A0720083
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Programs take on changing behavior at runtime in a simultaneous multithreading (SMT) environment. How reasonably common resources are distributed among the threads significantly determines the throughput and fairness performance in SMT processors. Existing resource distribution methods either mainly rely on the front-end fetch policy, or make distribution decisions according to the limited information from the pipeline. It is difficult for them to efficiently catch the various resource requirements of the threads. This work presents a spatially triggered dissipative resource distribution (SDRD) policy for SMT processors. Its two parts, the self-organization mechanism that is driven by the real-time instructions per cycle (IPC) performance and the introduction of chaos that tries to control the diversity of trial resource distributions, work together to supply sustaining resource distribution optimization for changing program behavior. Simulation results show that SDRD with fine-grained diversity controlling is more effective than that with a coarse-grained one. And SDRD benefits much from its two well-coordinated parts, providing potential fairness gains as well as good throughput gains. Meanings and settings of important SDRD parameters are also discussed.
引用
收藏
页码:1070 / 1082
页数:13
相关论文
共 50 条
  • [11] Implicit vs. explicit resource allocation in SMT processors
    Cazorla, FJ
    Knijnenburg, PMW
    Sakellariou, R
    Fernandez, E
    Ramirez, A
    Valero, M
    PROCEEDINGS OF THE EUROMICRO SYSTEMS ON DIGITAL SYSTEM DESIGN, 2004, : 44 - 51
  • [12] Instantaneous IPC based instruction fetch policy for SMT processors
    College of Computer Science, Inner Mongolia University, Huhhot 010021, China
    不详
    Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (04): : 629 - 637
  • [13] Achieving Predictable Performance in SMT Processors by Instruction Fetch Policy
    Sun, Caixia
    Wang, Yongwen
    Xu, Jinbo
    COMPUTER ENGINEERING AND TECHNOLOGY, NCCET 2013, 2013, 396 : 186 - 197
  • [14] Design of Non-Critical Path Resource Distributor for SMT Processors
    Chen, Hongzhou
    Ping, Lingdi
    Chen, Xiaoping
    Lu, Kuijun
    2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY, VOL II, PROCEEDINGS, 2009, : 48 - 52
  • [15] A memory-level parallelism aware fetch policy for SMT processors
    Eyerman, Stijn
    Eeckhout, Lieven
    THIRTEENTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 2007, : 240 - +
  • [16] Using instruction fetch policy to control performance of a thread in SMT processors
    School of Computer Science, National University of Defense Technology, Changsha 410073, China
    Jisuanji Xuebao, 2008, 2 (309-317):
  • [17] Soft real-time scheduling on SMT processors with explicit resource allocation
    Boneti, Carlos
    Cazorla, Francisco J.
    Gioiosa, Roberto
    Valero, Mateo
    ARCHITECTURE OF COMPUTING SYSTEMS - ARCS 2008, PROCEEDINGS, 2008, 4934 : 173 - +
  • [18] Enhancing ICOUNT2.8 fetch policy with better fairness for SMT processors
    Sun, Caixia
    Tang, Hongwei
    Zhang, Minxuan
    ADVANCES IN COMPUTER SYSTEMS ARCHITECTURE, PROCEEDINGS, 2006, 4186 : 459 - 465
  • [19] A Fetch policy maximizing throughput and fairness for two-context SMT processors
    Sun, CX
    Tang, HW
    Zhang, MX
    ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2005, 3756 : 13 - 22
  • [20] Hill-Climbing SMT Processor Resource Distribution
    Choi, Seungryul
    Yeung, Donald
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2009, 27 (01):