Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Invasive Computing for Mapping Parallel Programs to Many-Core ArchitecturesHybrid Application Mapping

Invasive Computing for Mapping Parallel Programs to Many-Core Architectures: Hybrid Application... [Previously, a new class of distributed application run-time mapping algorithms called self-embedding was presented. They are not designed for hard real-time applications which require an upper bound for end-to-end latency. To achieve predictability or even *-predictability, a static (performance) analysis is inevitable to determine and optimize upper and lower bounds. Therefore, a novel hybrid application mapping methodology (consisting of a design-time analysis and run-time mapping) is introduced. In contrast to related work, a packet-switched NoC communication, as in the invasive NoC, is considered.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Loading next page...
 
/lp/springer-journals/invasive-computing-for-mapping-parallel-programs-to-many-core-H6WkiSGm0c
Publisher
Springer Singapore
Copyright
© Springer Nature Singapore Pte Ltd. 2018
ISBN
978-981-10-7355-7
Pages
85 –135
DOI
10.1007/978-981-10-7356-4_5
Publisher site
See Chapter on Publisher Site

Abstract

[Previously, a new class of distributed application run-time mapping algorithms called self-embedding was presented. They are not designed for hard real-time applications which require an upper bound for end-to-end latency. To achieve predictability or even *-predictability, a static (performance) analysis is inevitable to determine and optimize upper and lower bounds. Therefore, a novel hybrid application mapping methodology (consisting of a design-time analysis and run-time mapping) is introduced. In contrast to related work, a packet-switched NoC communication, as in the invasive NoC, is considered.]

Published: Dec 30, 2017

There are no references for this article.