Combine Thread with Memory Scheduling for Maximizing Performance in Multi-core Systems

被引:0
作者
Jia, Gangyong [1 ]
Han, Guangjie [2 ]
Shi, Liang [3 ]
Wan, Jian [1 ]
Dai, Dong [4 ]
机构
[1] Hangzhou Dianzi Univ, Dept Comp Sci & Technol, Hangzhou 310018, Zhejiang, Peoples R China
[2] Hohai Univ, Dept Comp Sci, Changzhou 213022, Peoples R China
[3] Chongqing Univ, Dept Comp Sci & Technol, Chongqing 400044, Peoples R China
[4] Texas Tech Univ, Dept Comp Sci, Lubbock, TX 79409 USA
来源
2014 20TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS) | 2014年
基金
美国国家科学基金会;
关键词
Thread scheduling; memory scheduling; memory interference; memory access time; performance; energy;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The growing gap between microprocessor speed and DRAM speed is a major problem that computer designers are facing. In order to narrow the gap, it is necessary to improve DRAM's speed and throughput. Moreover, on multi-core platforms, DRAM memory shared by all cores usually suffers from the memory contention and interference problem, which can cause serious performance degradation and unfairness among parallel running threads. To address these problems, this paper proposes techniques to take both advantages of partitioning cores, threads and memory banks into groups to reduce interference among different groups and grouping the memory accesses of the same row together to reduce cache miss rate. A memory optimization framework combined thread scheduling with memory scheduling (CTMS) is proposed in this paper, which simultaneously minimizes memory access schedule length, memory access time and reduce interference to maximize performance for multi-core systems. Experimental results show CTMS is 12.6% shorter in memory access time, while improving 11.8% throughput on average. Moreover, CTMS also saves 5.8% of the energy consumption.
引用
收藏
页码:298 / 305
页数:8
相关论文
共 50 条
  • [31] Co-scheduling tasks on multi-core heterogeneous systems: An energy-aware perspective
    Libutti, Simone
    Massari, Giuseppe
    Fornaciari, William
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (02) : 77 - 84
  • [32] Improved scheduler for multi-core many-core systems
    Kumar, Neetesh
    Vidyarthi, Deo Prakash
    COMPUTING, 2014, 96 (11) : 1087 - 1110
  • [33] Energy-Constrained Scheduling of DAGs on Multi-core Processors
    Ahmad, Ishfaq
    Arora, Roman
    White, Derek
    Metsis, Vangelis
    Ingram, Rebecca
    CONTEMPORARY COMPUTING, PROCEEDINGS, 2009, 40 : 592 - +
  • [34] Temperature-aware task scheduling algorithm for soft real-time multi-core systems
    Wu, Guowei
    Xu, Zichuan
    JOURNAL OF SYSTEMS AND SOFTWARE, 2010, 83 (12) : 2579 - 2590
  • [35] Dynamic Reliability-Optimised and Energy-Efficient Scheduling Algorithms in Heterogeneous Multi-core Systems
    Liu, Jiawei
    Wu, Jing
    Han, Yu
    Hu, Wei
    Zhang, Ping
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT II, KSEM 2024, 2024, 14885 : 72 - 84
  • [36] Scheduling on Heterogeneous Multi-core Processors Using Stable Matching Algorithm
    Zafar, Muhammad Rehman
    Asfand-e-Yar, Muhammad
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (06) : 506 - 509
  • [37] A Job Scheduling Approach for Multi-core Clusters Based on Virtual Malleability
    Utrera, Gladys
    Tabik, Siham
    Corbalan, Julita
    Labarta, Jesus
    EURO-PAR 2012 PARALLEL PROCESSING, 2012, 7484 : 191 - 203
  • [38] Decentralized Preemptive Scheduling Across Heterogeneous Multi-core Grid Resources
    Balasubramanian, Arun
    Sussman, Alan
    Sadeh, Norman
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, JSSPP 2013, 2014, 8429 : 22 - 41
  • [39] Merge: A programming model for heterogeneous multi-core systems
    Linderman, Michael D.
    Collins, Jamison D.
    Wang, Hong
    Meng, Teresa H.
    ACM SIGPLAN NOTICES, 2008, 43 (03) : 287 - 296
  • [40] Understanding the Impact of Cache Performance on Multi-core Architectures
    Ramasubramaniam, N.
    Srinivas, V. V.
    Kumar, P. Pavan
    INFORMATION TECHNOLOGY AND MOBILE COMMUNICATION, 2011, 147 : 403 - 406