The University of Southampton
University of Southampton Institutional Repository

A pareto-optimal runtime power budgeting scheme for many-core systems

A pareto-optimal runtime power budgeting scheme for many-core systems
A pareto-optimal runtime power budgeting scheme for many-core systems
Due to the ever-escalating power consumption, a significant proportion of the future many-core chips is mandatory to be switched off to meet the power budgets. This trend has brought up a paradigm shift from conventional low-power to power budgeting designs, where performance optimization needs to be performed under a tight power budget constraint. There are two key issues to be considered when moving this new design paradigm forward. Firstly, with per-core frequency scaling, the number of frequency combinations of the cores grows exponentially. As more cores are integrated onto a chip, it becomes more challenging to achieve the optimal performance over a given power budget. Secondly, the power budgets of many-core system might undergo a rapid fluctuation. Consequently, the power budgeting scheme needs to be prompt to make appropriate changes to track such power budget variation. This paper is aiming at resolving the problem of optimizing overall performance over a power budget using frequency scaling technique. To solve the problem efficiently at runtime, we propose a parallel dynamic programming network, in which the Pareto-optimal solutions can be obtained using linear time complexity. Experimental results have confirmed that the proposed approach can reduce the execution time by 45% when compared to other existing methods. The runtime overhead and hardware cost of the proposed approach are reasonably small, such as the average area and power consumption are less than 1% of the whole network-on-chip. This paper demonstrates an effective formulation for delivering Pareto-optimal solutions for power budgeting in future many-core systems.
136-148
Wang, X.
976221d1-3004-409c-8640-715bedfc5d15
Zhao, B.
173c3078-5ba8-476a-aab2-df6e01e9559d
Wang, L.
ff28fc9d-dbeb-460f-943c-f49997f58bf7
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53
Yang, M.
10224d09-ea3b-40f9-8d15-513652d644b7
Daneshtalab, M.
7ea1b16c-4d73-4d30-a50a-6a9dc34d5288
Wang, X.
976221d1-3004-409c-8640-715bedfc5d15
Zhao, B.
173c3078-5ba8-476a-aab2-df6e01e9559d
Wang, L.
ff28fc9d-dbeb-460f-943c-f49997f58bf7
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53
Yang, M.
10224d09-ea3b-40f9-8d15-513652d644b7
Daneshtalab, M.
7ea1b16c-4d73-4d30-a50a-6a9dc34d5288

Wang, X., Zhao, B., Wang, L., Mak, T., Yang, M. and Daneshtalab, M. (2016) A pareto-optimal runtime power budgeting scheme for many-core systems. Microprocessors and Microsystems, 46, part B, 136-148. (doi:10.1016/j.micpro.2016.03.006).

Record type: Article

Abstract

Due to the ever-escalating power consumption, a significant proportion of the future many-core chips is mandatory to be switched off to meet the power budgets. This trend has brought up a paradigm shift from conventional low-power to power budgeting designs, where performance optimization needs to be performed under a tight power budget constraint. There are two key issues to be considered when moving this new design paradigm forward. Firstly, with per-core frequency scaling, the number of frequency combinations of the cores grows exponentially. As more cores are integrated onto a chip, it becomes more challenging to achieve the optimal performance over a given power budget. Secondly, the power budgets of many-core system might undergo a rapid fluctuation. Consequently, the power budgeting scheme needs to be prompt to make appropriate changes to track such power budget variation. This paper is aiming at resolving the problem of optimizing overall performance over a power budget using frequency scaling technique. To solve the problem efficiently at runtime, we propose a parallel dynamic programming network, in which the Pareto-optimal solutions can be obtained using linear time complexity. Experimental results have confirmed that the proposed approach can reduce the execution time by 45% when compared to other existing methods. The runtime overhead and hardware cost of the proposed approach are reasonably small, such as the average area and power consumption are less than 1% of the whole network-on-chip. This paper demonstrates an effective formulation for delivering Pareto-optimal solutions for power budgeting in future many-core systems.

This record has no associated files available for download.

More information

Accepted/In Press date: 3 March 2016
e-pub ahead of print date: 29 March 2016
Published date: October 2016
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 401852
URI: http://eprints.soton.ac.uk/id/eprint/401852
PURE UUID: 97a53968-f5a7-41bc-9eb1-34555d63f18e

Catalogue record

Date deposited: 24 Oct 2016 13:39
Last modified: 15 Mar 2024 02:56

Export record

Altmetrics

Contributors

Author: X. Wang
Author: B. Zhao
Author: L. Wang
Author: T. Mak
Author: M. Yang
Author: M. Daneshtalab

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×