CAJ | 학술논문

系统故障恢复时间是众核系统容错的一项重要指标。为加快系统故障恢复，在基于消息传递模型的众核系统中提出一种快速的拓扑重配置容错方法。首先根据物理拓扑故障情况为每个核心定义映射区域，利用匈牙利算法快速构建初始解；然后通过限制交错映射的发生，采用禁忌搜索在初始解的基础上快速优化，获得最终重配置映射解；最后根据重配置映射解更新各运算节点上的节点映射关系表完成拓扑重配置，实现众核系统的核级容错。实验结果表明，该方法能够快速找到优化的拓扑重配置方案并成功地完成系统恢复，具有较低的容错时间开销。
계통고장회복시간시음핵계통용착적일항중요지표。위가쾌계통고장회복，재기우소식전체모형적음핵계통중제출일충쾌속적탁복중배치용착방법。수선근거물리탁복고장정황위매개핵심정의영사구역，이용흉아리산법쾌속구건초시해；연후통과한제교착영사적발생，채용금기수색재초시해적기출상쾌속우화，획득최종중배치영사해；최후근거중배치영사해경신각운산절점상적절점영사관계표완성탁복중배치，실현음핵계통적핵급용착。실험결과표명，해방법능구쾌속조도우화적탁복중배치방안병성공지완성계통회복，구유교저적용착시간개소。
System fault‐recovery time is a key objective for fault tolerance in manycore systems .To accelerate system recovery from faults ,a fast topology reconfiguration strategy is proposed for fault tolerance in message passing model based manycore systems .Firstly ,a mapping domain is defined for each core according to the fault condition of the physical topology and Hungarian algorithm is adopted for fast generation of the initial solution .Secondly ,by restricting twisted mappings ,Tabu search is employed to perform a fast optimization based on the initial solution and obtain the final reconfiguration mapping solution .Finally ,by updating the mapping table on each computational node according to the reconfiguration mapping solution and completing the topology reconfiguration , the core‐level fault tolerance of a manycore system is realized .The experimental results show that ,the proposed strategy is capable of finding an optimal topology reconfiguration solution rapidly and recovering the system successfully w hile maintaining low time overhead for fault tolerance .