The University of Southampton
University of Southampton Institutional Repository

On runtime adaptive tile defragmentation for resource management in many-core systems

On runtime adaptive tile defragmentation for resource management in many-core systems
On runtime adaptive tile defragmentation for resource management in many-core systems
Before an application can be actually launched in a many-core system, the first thing that needs to be done is to get the application mapped to a number of tiles (cores). Such online application mapping process may unfortunately lead to a serious resource leak problem, referred as tile fragmentation, that free (uncommitted) tiles from any single contiguous region are just inadequate to accommodate the performance needs of an incoming application, although the total number of free tiles may still exceed what is required to service this application. When applications have to be mapped to noncontiguous tiles due to fragmentation, there will be obvious performance penalty due to increased communication distances. As a result, defragmentation that consolidates fragmented tiles needs to be routinely exercised, and this defragmentation process must not introduce high computation overhead that otherwise can adversely impact the system performance. In this paper, we propose a task migration-based adaptive tile defragmentation algorithm that helps consolidate running applications through online task migration. This algorithm relocates the applications’ tile regions so that a contiguous free tile region is formed and maintained. By doing so, future applications can be mapped to a region with low communication distance. Both the computation overhead and quality of defragmentation result of the proposed algorithm are adaptively set in response to the system workloads. Enabled by its low overhead, the proposed defragmentation algorithm is an effective resource management enhancement to the existing runtime task-to-tile mapping methods, with as much as 3× system throughput improvement observed in some experiments.
161-174
Fei, T.
f2c4c59f-99ca-4c32-b6d7-44a153a30bbe
Wang, X.
43a1af58-225d-4b86-9026-0fecbc8daf03
Zhang, B.
0944e483-9118-4f70-9815-acdcad5dfeec
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53
Fei, T.
f2c4c59f-99ca-4c32-b6d7-44a153a30bbe
Wang, X.
43a1af58-225d-4b86-9026-0fecbc8daf03
Zhang, B.
0944e483-9118-4f70-9815-acdcad5dfeec
Mak, T.
0f90ac88-f035-4f92-a62a-7eb92406ea53

Fei, T., Wang, X., Zhang, B. and Mak, T. (2016) On runtime adaptive tile defragmentation for resource management in many-core systems. Microprocessors and Microsystems, 46, part B, 161-174. (doi:10.1016/j.micpro.2016.02.004).

Record type: Article

Abstract

Before an application can be actually launched in a many-core system, the first thing that needs to be done is to get the application mapped to a number of tiles (cores). Such online application mapping process may unfortunately lead to a serious resource leak problem, referred as tile fragmentation, that free (uncommitted) tiles from any single contiguous region are just inadequate to accommodate the performance needs of an incoming application, although the total number of free tiles may still exceed what is required to service this application. When applications have to be mapped to noncontiguous tiles due to fragmentation, there will be obvious performance penalty due to increased communication distances. As a result, defragmentation that consolidates fragmented tiles needs to be routinely exercised, and this defragmentation process must not introduce high computation overhead that otherwise can adversely impact the system performance. In this paper, we propose a task migration-based adaptive tile defragmentation algorithm that helps consolidate running applications through online task migration. This algorithm relocates the applications’ tile regions so that a contiguous free tile region is formed and maintained. By doing so, future applications can be mapped to a region with low communication distance. Both the computation overhead and quality of defragmentation result of the proposed algorithm are adaptively set in response to the system workloads. Enabled by its low overhead, the proposed defragmentation algorithm is an effective resource management enhancement to the existing runtime task-to-tile mapping methods, with as much as 3× system throughput improvement observed in some experiments.

Full text not available from this repository.

More information

Accepted/In Press date: 5 February 2016
e-pub ahead of print date: 26 February 2016
Published date: October 2016
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 401853
URI: http://eprints.soton.ac.uk/id/eprint/401853
PURE UUID: a2030fc1-1f69-4665-b0df-2e6c8839edf8

Catalogue record

Date deposited: 24 Oct 2016 13:41
Last modified: 15 Jul 2019 19:59

Export record

Altmetrics

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.

×