| N体问题并行算法的探讨 |
| |
| 引用本文： | 吕菲,张华,张龙霞. N体问题并行算法的探讨[J]. 漯河职业技术学院学报, 2008, 7(2): 40-41 |
| |
| 作者姓名： | 吕菲 张华 张龙霞 |
| |
| 作者单位： | 武警工程学院,基础部,信息技术教研室,陕西,西安710086 |
| |
| 摘 要： | N体问题是研究天体间万有引力的问题，属于易并行计算的范畴。本文探讨了N体问题的顺序算法和并行算法，并给出实验结果。通过对两种算法的性能分析，说明了运用并行算法的优点和缺点。
|
| 关 键 词： | N体问题 曼德勃罗特问题 数据结构 时间复杂度 |
| 文章编号： | 1671-7864(2008)02-0040-02 |
| 修稿时间： | 2008-01-21 |
Research on A Parallel Algorithm for N-body Problem |
| |
| LV Fei,ZHANG Hua,ZHANG Long-xia. Research on A Parallel Algorithm for N-body Problem[J]. Journal of Luohe Vocational and Technical College, 2008, 7(2): 40-41 |
| |
| Authors: | LV Fei ZHANG Hua ZHANG Long-xia |
| |
| Affiliation: | (Engineering College of Armed Police Force,Basis Department,Xi＇ an 710086, China) |
| |
| Abstract: | N-body problem is a problem researching on the universal gravitation between celestial bodies,this problem belong to the category of parallel calculation.sequential algorithm,and parallel algorithm was investigated in this paper,then,the experimental result has been given out.Finally,the advantages and disadvantages of parallel algorithm was explained through the performance analysis on both kinds of algorithms. |
| |
| Keywords: | N-body problem Mandelbrot problem data structure time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
