Maximizing common idle time on multi-core processors with shared memory

Chenchen Fu; Yingchao Zhao; Minming Li; Chun Jason Xue

doi:10.7873/date.2015.0739

Maximizing common idle time on multi-core processors with shared memory

Chenchen Fu
, Yingchao Zhao
, Minming Li
, Chun Jason Xue

City University of Hong Kong
Caritas Institute of Higher Education

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Reducing energy consumption is a critical problem in most of the computing systems today. This paper focuses on reducing the energy consumption of the shared main memory in multi-core processors by putting it into sleep state when all the cores are idle. Based on this idea, this work presents systematic analysis of different assignment and scheduling models and proposes a series of scheduling schemes to maximize the common idle time of all cores. An optimal scheduling scheme is proposed assuming the number of cores is unbounded. When the number of cores is bounded, an efficient heuristic algorithm is proposed. The experimental results show that the heuristic algorithm works efficiently and can save as much as 25.6% memory energy compared to a conventional multi-core scheduling scheme.

Original language	English
Title of host publication	Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	900-903
Number of pages	4
ISBN (Electronic)	9783981537048
DOIs	https://doi.org/10.7873/date.2015.0739
State	Published - 22 Apr 2015
Externally published	Yes
Event	2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 - Grenoble, France Duration: 9 Mar 2015 → 13 Mar 2015

Publication series

Name	Proceedings -Design, Automation and Test in Europe, DATE
Volume	2015-April
ISSN (Print)	1530-1591

Conference

Conference	2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015
Country/Territory	France
City	Grenoble
Period	9/03/15 → 13/03/15

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Access to Document

10.7873/date.2015.0739

Cite this

Fu, C., Zhao, Y., Li, M., & Xue, C. J. (2015). Maximizing common idle time on multi-core processors with shared memory. In Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 (pp. 900-903). Article 7092514 (Proceedings -Design, Automation and Test in Europe, DATE; Vol. 2015-April). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.7873/date.2015.0739

@inproceedings{63ab0fc25d0449e8bebc8211fc23950d,

title = "Maximizing common idle time on multi-core processors with shared memory",

abstract = "Reducing energy consumption is a critical problem in most of the computing systems today. This paper focuses on reducing the energy consumption of the shared main memory in multi-core processors by putting it into sleep state when all the cores are idle. Based on this idea, this work presents systematic analysis of different assignment and scheduling models and proposes a series of scheduling schemes to maximize the common idle time of all cores. An optimal scheduling scheme is proposed assuming the number of cores is unbounded. When the number of cores is bounded, an efficient heuristic algorithm is proposed. The experimental results show that the heuristic algorithm works efficiently and can save as much as 25.6\% memory energy compared to a conventional multi-core scheduling scheme.",

author = "Chenchen Fu and Yingchao Zhao and Minming Li and Xue, \{Chun Jason\}",

note = "Publisher Copyright: {\textcopyright} 2015 EDAA.; 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015 ; Conference date: 09-03-2015 Through 13-03-2015",

year = "2015",

month = apr,

day = "22",

doi = "10.7873/date.2015.0739",

language = "英语",

series = "Proceedings -Design, Automation and Test in Europe, DATE",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "900--903",

booktitle = "Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015",

address = "美国",

}

Fu, C, Zhao, Y, Li, M & Xue, CJ 2015, Maximizing common idle time on multi-core processors with shared memory. in Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015., 7092514, Proceedings -Design, Automation and Test in Europe, DATE, vol. 2015-April, Institute of Electrical and Electronics Engineers Inc., pp. 900-903, 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015, Grenoble, France, 9/03/15. https://doi.org/10.7873/date.2015.0739

Maximizing common idle time on multi-core processors with shared memory. / Fu, Chenchen; Zhao, Yingchao; Li, Minming et al.
Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 900-903 7092514 (Proceedings -Design, Automation and Test in Europe, DATE; Vol. 2015-April).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Maximizing common idle time on multi-core processors with shared memory

AU - Fu, Chenchen

AU - Zhao, Yingchao

AU - Li, Minming

AU - Xue, Chun Jason

PY - 2015/4/22

Y1 - 2015/4/22

N2 - Reducing energy consumption is a critical problem in most of the computing systems today. This paper focuses on reducing the energy consumption of the shared main memory in multi-core processors by putting it into sleep state when all the cores are idle. Based on this idea, this work presents systematic analysis of different assignment and scheduling models and proposes a series of scheduling schemes to maximize the common idle time of all cores. An optimal scheduling scheme is proposed assuming the number of cores is unbounded. When the number of cores is bounded, an efficient heuristic algorithm is proposed. The experimental results show that the heuristic algorithm works efficiently and can save as much as 25.6% memory energy compared to a conventional multi-core scheduling scheme.

AB - Reducing energy consumption is a critical problem in most of the computing systems today. This paper focuses on reducing the energy consumption of the shared main memory in multi-core processors by putting it into sleep state when all the cores are idle. Based on this idea, this work presents systematic analysis of different assignment and scheduling models and proposes a series of scheduling schemes to maximize the common idle time of all cores. An optimal scheduling scheme is proposed assuming the number of cores is unbounded. When the number of cores is bounded, an efficient heuristic algorithm is proposed. The experimental results show that the heuristic algorithm works efficiently and can save as much as 25.6% memory energy compared to a conventional multi-core scheduling scheme.

UR - https://www.scopus.com/pages/publications/84945893177

U2 - 10.7873/date.2015.0739

DO - 10.7873/date.2015.0739

M3 - 会议稿件

AN - SCOPUS:84945893177

T3 - Proceedings -Design, Automation and Test in Europe, DATE

SP - 900

EP - 903

BT - Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015

Y2 - 9 March 2015 through 13 March 2015

ER -

Fu C, Zhao Y, Li M, Xue CJ. Maximizing common idle time on multi-core processors with shared memory. In Proceedings of the 2015 Design, Automation and Test in Europe Conference and Exhibition, DATE 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 900-903. 7092514. (Proceedings -Design, Automation and Test in Europe, DATE). doi: 10.7873/date.2015.0739

Maximizing common idle time on multi-core processors with shared memory

Abstract

Publication series

Conference

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this