期刊文献+

基于分布式并行调度的运载火箭飞行轨迹快速计算技术

Rapid calculation technology of launch vehicle fight trajectory based on distributed parallel scheduling
下载PDF
导出
摘要 为了保证运载火箭飞行轨迹计算软件对各类点位组合的适应性,需要对所有可能的点位组合进行全覆盖性测试,点位组合数量以亿次计,计算量巨大。文章提出了一种基于分布式并行调度的运载火箭飞行轨迹快速计算技术,采用“1+N”的分布式并行计算架构完成分布式并行计算调度平台设计与实现。通过计算验证,提出的基于分布式并行调度的运载火箭飞行轨迹快速计算技术使得点位测试过程中计算机资源使用率接近100%,大幅度提高了计算速度,将原有年量级的计算工作缩减至几天内完成,并且不影响计算结果的准确性。 In order to ensure the adaptability of the launch vehicle flight trajectory calculation software to various point combinations,it is necessary to conduct full coverage tests on all possible point combinations,and the number of point combinations is hundreds of millions of times,and the calculation amount is huge.This paper proposes a rapid flight trajectory calculation technology for launch vehicles based on distributed parallel scheduling,and uses the“I+N”distributed parallel computing architecture to complete the design and implementation of the distributed parallel computing scheduling platform.Through calculation verification,the proposed rapid calculation technology of launch vehicle flight trajectory based on distributed parallel scheduling makes the utilization rate of computer resources close to 100%in the process of point testing,greatly improves the calculation speed,shortens the original annual calculation work to a few days,and does not affect the accuracy of the calculation results.
作者 刘朝阳 王虹森 张晶莹 于宁 亓俊卿 LIU Zhaoyang;WANG Hongsen;ZHANG Jingying;YU Ning;QI Junqing(Beijing Institute of Astronautical Systems Engineering,Beijing 100076,China;Beijing Institute of Near Spacecraft Systems Engineering,Beijing 100076,China)
出处 《中国高新科技》 2023年第8期150-152,共3页
关键词 运载火箭 分布式并行 快速计算 launch vehicle distributed parallel scheduling fast computing
  • 相关文献

参考文献5

二级参考文献38

  • 1王飞跃.平行系统方法与复杂系统的管理和控制[J].控制与决策,2004,19(5):485-489. 被引量:322
  • 2王飞跃.计算实验方法与复杂系统行为分析和决策评估[J].系统仿真学报,2004,16(5):893-897. 被引量:147
  • 3金宏,王宏安,王强,戴国忠.改进的最小空闲时间优先调度算法[J].软件学报,2004,15(8):1116-1123. 被引量:25
  • 4王飞跃.关于复杂系统的建模、分析、控制和管理[J].复杂系统与复杂性科学,2006,3(2):26-34. 被引量:63
  • 5Orgerie A-C, Lefevre L, Gelas J-P. Demystifying energy con- sumption in Grids and Clouds[AT//Green Computing Confe- rence, 2010 International, 2010 [C]. Chicago, IL.. IEEE Confe- rence Publications, 2010:335-342.
  • 6Chase J S, Anderson D C, Thakar P N, et al. Managing energy and server resources in hosting centers[A]//Proceedings of the eighteenth ACM symposium on Operating systems principles (SOSP' 01), 2001[C]. New York, NY, USA.. ACM, 2001 :. 103- 116.
  • 7Yao C-C. New algorithm for bin-packing[J]. Journal of ACM, 1980,27 (2) : 207-227.
  • 8Verma A, Ahuia P, Neoqi A. Power-aware dynamic placement of HPC applications[A]//Proceedings of the 22nd annual interna- tional conference on Supercomputing (ICS ' 08), 2008 [C]. New York,NY,USA: ACM, 2008:175-184.
  • 9Johnson D. Near-Optimal Bin Packing Algorithms [M]. MIT, Cambridge, Massachusetts, 19 7 3 : 5 6.
  • 10Garnbosi G, Postiglione A, Talamo M. Algorithms for the re- laxed online bin-packing model [J]. SIAM Journal on Compu- ting, 2000,30(5) : 1532-1551.

共引文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部