Please use this identifier to cite or link to this item:
https://repository.cihe.edu.hk/jspui/handle/cihe/446
Title: | Maximizing common idle time on multicore processors with shared memory | Author(s): | Zhao, Yingchao | Author(s): | Fu, C. Li, M. Xue, C. J. |
Issue Date: | 2017 | Publisher: | IEEE | Journal: | IEEE Transactions on Very Large Scale Integration (VLSI) Systems | Volume: | 25 | Issue: | 7 | Start page: | 2095 | End page: | 2108 | Abstract: | Nowadays, memory energy reduction attracts significant attention as main memory consumes large amount of energy among all the energy consuming components. This paper focuses on reducing the energy consumption of the shared main memory in multicore processors by putting the memory into sleep state when all cores are idle. Based on this idea, we present systematic analysis of different models and propose a series of scheduling schemes to maximize the common idle time of all cores. The target problem is classified into two cases based on whether task migration is allowed or not among cores. Considering task migration, an optimal scheduling scheme is proposed, assuming the number of cores is unbounded. When the number of cores is bounded, an integer linear programming formulation and two efficient heuristic algorithms are proposed. When task migration is not allowed, we first prove the NP-hardness of the problem, and then propose the optimal solutions when task partitions are given in advance. The energy overhead caused by transitions between active and sleep modes of the memory is analyzed. The experimental results show that the heuristic algorithms work efficiently and can save 7.25% and 11.71% system energy, respectively, with 1-GB memory, compared with an energy-efficient multicore scheduling scheme. Larger energy reduction can be further achieved with larger size of memory. |
URI: | https://repository.cihe.edu.hk/jspui/handle/cihe/446 | DOI: | 10.1109/TVLSI.2017.2669973 | CIHE Affiliated Publication: | Yes |
Appears in Collections: | CIS Publication |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.