arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1910.06313cs.DCcs.SYeess.SYmath.OC
收藏

基于Parallel Computing体系结构的分布式在线任务重分配

Decentralized On-line Task Reallocation on Parallel Computing Architectures with Safety-Critical Applications

Thanakorn Khamvilai, Louis Sutter, Eric Feron, Philippe Baufreton, Francois Neumann

摘要:

针对并行计算体系结构中安全关键型应用,提出了一种分布式分配算法,其中单个计算单元可能受到故障的影响。所描述的方法在于通过抽象图来表示架构,其中每个节点表示计算单元。应用程序也由它们执行所需的计算单元图表示。然后,问题是决定如何将计算单元分配给应用程序以保证安全关键应用程序的执行。该问题被表述为一个优化问题,其形式为线性规划。然后使用最先进的求解器来解决问题。分散分配过程是通过在架构上执行的分配器的冗余来实现的。没有集中的元件决定整个架构的分配,从而提高了系统的可靠性。还提出了一个多核架构的实验再现。它被用来证明拟议的分配过程的能力,以维持一个分散的方式运行的物理系统,而个别组件发生故障。

英文摘要:

This work presents a decentralized allocation algorithm of safety-critical application on parallel computing architectures, where individual Computational Units can be affected by faults. The described method consists in representing the architecture by an abstract graph where each node represents a Computational Unit. Applications are also represented by the graph of Computational Units they require for execution. The problem is then to decide how to allocate Computational Units to applications to guarantee execution of the safety-critical application. The problem is formulated as an optimization problem, with the form of an Integer Linear Program. A state-of-the-art solver is then used to solve the problem. Decentralizing the allocation process is achieved through redundancy of the allocator executed on the architecture. No centralized element decides on the allocation of the entire architecture, thus improving the reliability of the system. Experimental reproduction of a multi-core architecture is also presented. It is used to demonstrate the capabilities of the proposed allocation process to maintain the operation of a physical system in a decentralized way while individual component fails.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑