首页> 外文期刊>Information Fusion >A scheduler for SCADA-based multi-source fusion systems
【24h】

A scheduler for SCADA-based multi-source fusion systems

机译:基于SCADA的多源融合系统的调度程序

获取原文
获取原文并翻译 | 示例
           

摘要

In this article, we report on our experience regarding devising, implementing, and deploying a scheduler for multi-source fusion in the context of SCADA systems (Supervisory Control and Data Acquisition). They are challenging because they commonly rely on low-end boards with very limited computing, memory, and storage capabilities, but have to run hundreds if not thousands of agents that co-ordinate by means of complex multi-way rendezvouses. Our work was carried out in the context of a solar plant in which we could easily confirm that not scheduling the rendez-vouses fairly may easily drive the system into as many as 3 779.10 critical-failure states per hour, whereas a straightforward solution to the problem can reduce the figure to 1 094.76 critical-failure states per hour. Unfortunately, that is far from zero, which is the ideal number. In the literature, there are several proposals to deal with this problem, but most of them could not be adapted to our context, namely: some of them can deal with two-way rendez-vouses only, whereas ours involve an average of 12.89 agents; others require to instrument the agents, but many of them are hardware devices that cannot be modified; a few others cannot work with rendez-vouses that can get intermittently enabled and disabled along an execution, which makes them of little interest in our context; and some require to use shared memory, which is an advanced hardware feature that is not supported by our low-end computing boards. The two proposals that we managed to adapt were not efficient enough in our context since they led to an average of 1 102.77 and 1 458.65 critical-failure states per hour, respectively. That motivated us to work on a new proposal that does not have any of the previous problems. It relies on a incremental approach that was implemented very efficiently using bounded counters and queues. Furthermore, the experimental results and the corresponding statistical analysis confirm that it works very well in practice.
机译:在本文中,我们在SCADA系统(监控和数据采集)的上下文中报告了我们对设计,实施和部署了多源融合的调度程序的经验。它们是挑战性的,因为它们通常依赖于具有非常有限的计算,内存和存储功能的低端板,但如果不是通过复杂的多途中统一的数千个代理商运行数千个代理。我们的工作是在太阳能电厂的背景下进行的,在太阳能电厂中,我们可以轻松证实,不公平调度rendez-vouses,可以轻松地将系统驱动到每小时多达3 779.10临界失败状态,而直接的解决方案问题可以将图1094.76每小时减少到1 094.76临界失败状态。不幸的是,这远非零,这是理想的数字。在文献中,有几个提案来处理这个问题,但大多数人都不能适应我们的背景,即:其中一些人只能处理双向伦敦电动仪,而我们的涉及平均12.89代理人;其他人要求仪器仪器,但其中许多是无法修改的硬件设备;少数其他人不能与rendez-vous一起使用,这些vous可以沿着执行间歇地启用和禁用,这使得它们对我们的背景感兴趣;有些需要使用共享内存,这是我们的低端计算板不支持的高级硬件功能。我们设法适应的两项建议在我们的背景下没有足够的效率,因为它们平均每小时平均每小时1 102.77和1 458.65临界失败状态。这使我们能够履行没有任何以前问题的新提案。它依赖于使用界限计数器和队列非常有效地实现的增量方法。此外,实验结果和相应的统计分析证实它在实践中非常运行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号