The University of Southampton
University of Southampton Institutional Repository

Defragmentation for efficient runtime resource management in NoC-based many-core systems

Defragmentation for efficient runtime resource management in NoC-based many-core systems
Defragmentation for efficient runtime resource management in NoC-based many-core systems
Efficient runtime resource allocation is critical to the overall performance and energy consumption of many-core systems. A region of free cores is allocated for each newly launched application. The cores are deallocated when the corresponding applications finish execution. The frequent allocations and deallocations of the cores might leave free cores scattered (not forming a contiguous region). This situation is referred to as fragmentation. Fragmentation could cause the inefficient mapping of the incoming applications, i.e., long communication distance between communicating cores. This further leads to poor performance and high energy consumption. In this paper, we propose a runtime defragmentation scheme that collects and reallocates the scattered cores in close proximity. We first define a fragmentation metric that is able to evaluate the scatteredness level of the free cores. Based on this, the proposed algorithm is executed to bring the scattered free cores together when the fragmentation metric is over a certain predefined threshold. In this way, the contiguous free core region is formed to facilitate the efficient mapping of the incoming applications. Moreover, the proposed algorithm also aims to minimize the negative impact on the performance of existing applications. Experimental results show that the proposed defragmentation scheme reduces the overall execution time and the energy consumption by 42% and 41%, respectively, when it is augmented to existing runtime mapping algorithms. Moreover, a negligible overhead, accounting for only less than 2.6% of the overall execution time, is required for the proposed defragmentation process. The proposed defragmentation scheme is an effective resource management enhancement to existing runtime mapping algorithms for many-core systems.
1063-8210
3359-3372
Ng, J.
3d2240f4-bcad-447d-ba52-43712e672a15
Singh, A.
fd0b4ff2-6df5-4489-9dda-ba73633d3cfa
Wang, X.
976221d1-3004-409c-8640-715bedfc5d15
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53
Ng, J.
3d2240f4-bcad-447d-ba52-43712e672a15
Singh, A.
fd0b4ff2-6df5-4489-9dda-ba73633d3cfa
Wang, X.
976221d1-3004-409c-8640-715bedfc5d15
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53

Ng, J., Singh, A., Wang, X. and Mak, T. (2016) Defragmentation for efficient runtime resource management in NoC-based many-core systems. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 24 (11), 3359-3372. (doi:10.1109/TVLSI.2016.2548564).

Record type: Article

Abstract

Efficient runtime resource allocation is critical to the overall performance and energy consumption of many-core systems. A region of free cores is allocated for each newly launched application. The cores are deallocated when the corresponding applications finish execution. The frequent allocations and deallocations of the cores might leave free cores scattered (not forming a contiguous region). This situation is referred to as fragmentation. Fragmentation could cause the inefficient mapping of the incoming applications, i.e., long communication distance between communicating cores. This further leads to poor performance and high energy consumption. In this paper, we propose a runtime defragmentation scheme that collects and reallocates the scattered cores in close proximity. We first define a fragmentation metric that is able to evaluate the scatteredness level of the free cores. Based on this, the proposed algorithm is executed to bring the scattered free cores together when the fragmentation metric is over a certain predefined threshold. In this way, the contiguous free core region is formed to facilitate the efficient mapping of the incoming applications. Moreover, the proposed algorithm also aims to minimize the negative impact on the performance of existing applications. Experimental results show that the proposed defragmentation scheme reduces the overall execution time and the energy consumption by 42% and 41%, respectively, when it is augmented to existing runtime mapping algorithms. Moreover, a negligible overhead, accounting for only less than 2.6% of the overall execution time, is required for the proposed defragmentation process. The proposed defragmentation scheme is an effective resource management enhancement to existing runtime mapping algorithms for many-core systems.

This record has no associated files available for download.

More information

Accepted/In Press date: 9 March 2016
e-pub ahead of print date: 20 April 2016
Published date: November 2016
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 401851
URI: http://eprints.soton.ac.uk/id/eprint/401851
ISSN: 1063-8210
PURE UUID: a19f5dfa-06b7-4f5c-9892-0e88f0c3bce8

Catalogue record

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

Export record

Altmetrics

Contributors

Author: J. Ng
Author: A. Singh
Author: X. Wang
Author: T. Mak

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.

×