组合打击下一类面目标易损性的并行计算研究  

Parallel algorithm of the vulnerability of the combination of multiple submunitions attacking area targets

作　　者：王多雷[1] 龙汉[1] 陈璇[1] 

机构地区：[1]国防科学技术大学理学院,湖南长沙410073

出　　处：《计算机工程与科学》2013年第4期42-46,共5页Computer Engineering & Science

摘　　要：以组合打击面目标为背景,对面目标的易损性问题进行了研究,介绍了面目标易损性问题中研究毁伤概率和毁伤失效时间的重要性,本文通过基于此的毁伤效能评估问题对面目标易损性展开了分析,毁伤元主要考虑具有延时能力与非延时能力等子弹药组合,分析了该问题中毁伤概率的Monte-Carlo仿真对计算资源的极大需求,并构造了该方法适用于高性能系统平台的并行算法,最后给出了一个数值仿真算例。仿真结果表明,这种并行方式能较好地解决此类问题对计算资源、计算速度和计算效率的需求。This paper studies the vulnerability problem of area target based on the background of the combination of multiple submunitions. In this paper, the importance issues of damage probability and damage failure time in the vulnerability of area target is introduced; the performance evaluation of vulnerability of area target through related damages is analyzed~ the combination of submunitions about delay capacity and non-delay capacity are considered in damage sources;the demand of computation resources is analyzed for the Monte-Carlo simulation of damage probability a suitable high-performance platform is constructed with this parallel algorithm and finally,a numerical simulation example is given to test the algorithm＇s efficiency. The simulation results show that those problems of computation resources, speed and efficiency can all be solved effectively by this parallel algorithm.

关 键 词：组合打击 面目标易损性 蒙特卡罗方法 并行算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]