L.T. Smit
Run-time assignment of tasks to multiple heterogeneous processors
Smit, L.T.; Smit, G.J.M.; Hurink, J.L.; Broersma, H.J.; Paulusma, D.; Wolkotte, P.T.
Authors
G.J.M. Smit
J.L. Hurink
H.J. Broersma
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
P.T. Wolkotte
Abstract
This paper describes the implementation and evaluation of an algorithm that maps a number of communicating processes to a heterogeneous tiled System on Chip (SoC) architecture at run-time. The mapping algorithm minimizes the total amount of energy consumption, while still providing an adequate Quality of Service (QoS). The properties of the algorithmare described and evaluated and a realistic mapping example is given.
Citation
Smit, L., Smit, G., Hurink, J., Broersma, H., Paulusma, D., & Wolkotte, P. (2004, December). Run-time assignment of tasks to multiple heterogeneous processors. Presented at 5th PROGRESS Symposium on Embedded Systems., Nieuwegein, The Netherlands
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | 5th PROGRESS Symposium on Embedded Systems. |
Publication Date | Jan 1, 2004 |
Deposit Date | Dec 21, 2014 |
Pages | 185-192 |
Keywords | Mapping, Systemon Chip (SoC), Run-time, Tiled, Heterogeneous, Reconfigurable, Architecture, DRM |
Public URL | https://durham-repository.worktribe.com/output/1153808 |
Publisher URL | http://www2.fhi.nl/progress/images/smit%20l.t..pdf |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article