Adaptive Mapping for Multiple Applications on Parallel Architectures

Abstract : We propose a novel adaptive approach capable of handling dynamism of a set of applications on network-on-chip. The applications are subject to throughput or energy consumption constraints. For each application, a set of non-dominated (Pareto) schedules are computed at design-time in the (energy, period, processors) space for different cores topologies. Then, upon the starting or ending of an application, a lightweight adaptive run-time scheduler reconfigures the mapping of the live applications according to the available resources (i.e., the available cores of the network-on-chip). This run-time scheduler selects the best topology for each application and maps them to the network-on-chip using the tetris algorithm. This novel scheduling approach is adaptive, it changes the mapping of applications during their execution, and thus delivers just enough power to achieve applications constraints.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01672463
Contributor : Alain Girault <>
Submitted on : Monday, December 25, 2017 - 12:40:00 PM
Last modification on : Wednesday, September 25, 2019 - 3:12:06 PM

File

main-short.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01672463, version 1

Collections

Citation

Ismail Assayad, Alain Girault. Adaptive Mapping for Multiple Applications on Parallel Architectures. Third International Symposium on Ubiquitous Networking, UNET'17, May 2017, Casablanca, Morocco. ⟨hal-01672463⟩

Share

Metrics

Record views

130

Files downloads

177