论文标题
MAPN:算法和并行性适应性的建模,分析和探索
mAPN: Modeling, Analysis, and Exploration of Algorithmic and Parallelism Adaptivity
论文作者
论文摘要
如今,使用并行嵌入式系统正在增加。由于将多个功能集成到一个应用程序中或同时运行许多功能,因此它们变得越来越复杂。这涉及广泛的应用程序,包括流媒体应用程序,通常在嵌入式系统中使用。这些应用程序必须实施适应性和可靠的算法,以在不同情况下(例如,在平台上运行的应用程序,输入数据,平台多样性等)提供所需的性能。鉴于流媒体应用程序,目标系统和适应性要求的复杂性,通过传统编程模型设计此类系统是令人生畏的。这就是为什么长期以来研究具有适当计算模型(MOC)的基于模型的策略的原因。这项工作为动态数据流提供了平行性的算法适应性,以表达较大的变体集。我们提出了一个多功能过程网络(MAPN),这是一个高级抽象表示,其中同一应用程序的几个变体在同一图表中共存,表达不同的实现。我们介绍MAPN属性及其形式主义,以描述各种本地实施替代方案。此外,MAPN富含元数据,以根据特定度量为替代方案提供定量注释。为了帮助用户分析变体的丰富空间,我们提出了一种方法,以提取用户和硬件约束下的可行变体。该方法的核心是一种用于计算紧凑型MAPN规范执行不同替代方案的全局指标的算法。我们通过探索为两个硬件平台上的自动字幕应用程序(ASA)创建的几种可能的变体来验证我们的方法。
Using parallel embedded systems these days is increasing. They are getting more complex due to integrating multiple functionalities in one application or running numerous ones concurrently. This concerns a wide range of applications, including streaming applications, commonly used in embedded systems. These applications must implement adaptable and reliable algorithms to deliver the required performance under varying circumstances (e.g., running applications on the platform, input data, platform variety, etc.). Given the complexity of streaming applications, target systems, and adaptivity requirements, designing such systems with traditional programming models is daunting. This is why model-based strategies with an appropriate Model of Computation (MoC) have long been studied for embedded system design. This work provides algorithmic adaptivity on top of parallelism for dynamic dataflow to express larger sets of variants. We present a multi-Alternative Process Network (mAPN), a high-level abstract representation in which several variants of the same application coexist in the same graph expressing different implementations. We introduce mAPN properties and its formalism to describe various local implementation alternatives. Furthermore, mAPNs are enriched with metadata to Provide the alternatives with quantitative annotations in terms of a specific metric. To help the user analyze the rich space of variants, we propose a methodology to extract feasible variants under user and hardware constraints. At the core of the methodology is an algorithm for computing global metrics of an execution of different alternatives from a compact mAPN specification. We validate our approach by exploring several possible variants created for the Automatic Subtitling Application (ASA) on two hardware platforms.