Partitioning Of Hierarchical Automation Systems

E Ciapessoni,A Ornstein, S Crespi-Reghizzi,G Psaila, F Maestri, J Szanto

ECRTS '01: Proceedings of the 13th Euromicro Conference on Real-Time Systems(2001)

引用 2|浏览13
暂无评分
摘要
The research described concerns the partitioning of large control applications for a multi-computer system in order to meet plant localization requirements and to exploit parallelism. The considered applications have hierarchical structure and are composed by a network of automata.Our application domain is the automation of power stations and electricity, distribution. Because of strong EM noise in such environments, the software architecture is organized to be tolerant to transient faults, which could affect the stability, of the control system. The hierarchical structure provides a decompositional approach to the design of complex applications. The context for this work is the ASFA platform, originally designed by the Italian board of electricity. The main result is a new partitioning algorithm for hierarchical automata net-works, that splits the application into subnetworks which are deadlock-free, compliant with localization constraints, and as parallelizable as possible. The algorithm is also able to satisfy mutual exclusion constraints and to take into account computation/communication weights to achieve balancing of partitions.
更多
查看译文
关键词
fault tolerant computing,power system control,software architecture,application domain,automata,decompositional approach,electricity distribution,hierarchical automata networks,hierarchical automation systems partitioning,localization constraints,mutual exclusion constraints,plant localization requirements,power stations,transient faults,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要