Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/446
DC FieldValueLanguage
dc.contributor.authorZhao, Yingchaoen_US
dc.contributor.otherFu, C.-
dc.contributor.otherLi, M.-
dc.contributor.otherXue, C. J.-
dc.date.accessioned2021-03-29T07:30:47Z-
dc.date.available2021-03-29T07:30:47Z-
dc.date.issued2017-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/446-
dc.description.abstractNowadays, 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.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartofIEEE Transactions on Very Large Scale Integration (VLSI) Systemsen_US
dc.titleMaximizing common idle time on multicore processors with shared memoryen_US
dc.typejournal articleen_US
dc.identifier.doi10.1109/TVLSI.2017.2669973-
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.issn1557-9999en_US
dc.description.volume25en_US
dc.description.issue7en_US
dc.description.startpage2095en_US
dc.description.endpage2108en_US
dc.cihe.affiliatedYes-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypejournal article-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptYam Pak Charitable Foundation School of Computing and Information Sciences-
crisitem.author.orcid0000-0001-8362-6735-
Appears in Collections:CIS Publication
SFX Query Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.