<< Click to display Table of content >> Computation Time |
![]() ![]() ![]() |
Principle
A simulation is divided in 2 parts: a geometric part and a physical one. The geometric part is the most costly (85 to 90% of simulation time).
The geometric simulation identifies the propagation paths by a method of beam tracing from the antennas to the receivers. This simulation is subdivided into two parts: a search for propagation paths in 2D (ground projection of the geometric model) and the reconstruction of these paths in 3D. The search for the 2D paths takes place from the same position (X, Y), meaning from each antenna support of the model. The parallelization of the simulation is on the antenna supports.
Some simplification:
1.Computation time is the same for each antenna support.
2.The processors speed is the same (speed = frequency, 2Ghz for example).
3.Initialization time and finalization time are very short and ignore.
Rules:
•If the model has only one antenna support, computation time is not depending of the number of core.
•For 4 supports, the simulation is 4 time faster on 4 cores than on one core.
•While nb supports > nb cores, if the number of core increases, the computation time will decrease significantly.
Example
The model has 69 antennas distributed on 32 supports.
CPU |
Memory |
OS |
Time |
4 processors : i7 2.93GHz |
16 Gb |
Windows 7 x64 |
34 min |
2 processors : i5 2.67GHz |
4 Gb |
Windows 7 x64 |
1h38m |
2 processors : i7 4510U, 2GHz |
8 Gb |
Windows 7 x64 |
1h01min |