作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• •    

动态异构冗余架构执行体同步算法研究与应用

  • 发布日期:2026-01-05

Research and Application of Executor Synchronization Algorithm for Dynamic Heterogeneous Redundant Architecture

  • Published:2026-01-05

摘要: 动态异构冗余架构(DHR)采用多维动态重构实现执行体的异构和冗余,基于策略裁决的闭环迭代实现系统的动态更新,赋予系统内在安全基因,使其具备天然的主动防御能力。然而,DHR通常需要执行体有较大的异构性以避免共有漏洞而造成的攻击逃逸现象,异构性带来的差异会导致执行体出现因应用程序状态转换不一致、加密输出不一致,导致的输出结果无法裁决的问题。本文针对上述问题,以分布式共识理论为基础,提出了一种隐藏领导者分布式共识算法。该算法采用基于相对时间的程序进程同步方法,解决异构执行体运行状态失步问题;采用密源归一化策略,解决异构执行体数据加密和报文中的随机数差异问题。具体介绍了算法的运行机理,给出了算法流程;最后搭建了验证平台对算法的有效性进行了对比测试。测试结果表明,在复杂进程调度应用中的不同实验场景下,该算法相较于已有的同步方法,可分别提升0.82%和5.65%的进程同步率,并能实现加密数据的正确裁决处理,吞吐量相较基于加密解密的密文裁决方法可提升大约68.38%。

Abstract: The Dynamic Heterogeneous Redundancy Architecture (DHR) uses multi-dimensional dynamic reconfiguration to achieve heterogeneity and redundancy of executors, and closed-loop iteration based on policy adjudication realizes dynamic update of the system, giving the system inherent security genes and making it have natural proactive defense capabilities. However, DHR usually requires large heterogeneity of the executor to avoid attack and escape caused by shared vulnerabilities. However, the differences caused by heterogeneity can lead to inconsistent application state transitions and inconsistent encryption output of the executor, resulting in the problem that the output results cannot be adjudicated. Aiming at the above problems, this paper proposes a hidden leader distributed consensus algorithm based on distributed consensus theory. The algorithm adopts a relative time-based program process synchronization method to solve the problem of out-of-step running state of heterogeneous executors, and adopts a secret source normalization strategy to solve the problems of data encryption and random number differences in messages of heterogeneous executors. The operating mechanism of the algorithm is introduced in detail and the algorithm flow is given. Finally, a verification platform is built to compare and test the effectiveness of the algorithm. Test results show that in complex process scheduling scenarios, compared with existing algorithms, this method can improve the process synchronization success rates by 0.82% and 5.65% respectively, and can achieve correct adjudication of encrypted data. Compared with the ciphertext adjudication method based on encryption and decryption, the throughput can be improved by approximately 68.38%.