| Popis: |
Several particle simulation algorithms, such as the Barnes-Hut [1] and the Fast Multipole method [2], proceed by hierarchically decomposing the simulation space and representing the distribution of the simulated particles in an adaptive tree data structure which varies as the simulation proceeds. Such tree structures are also used in radiosity calculation, computational fluid mechanics, and other applications. Managing such a structure on a distributed-memory machine poses significant difficulties in terms of communication costs and partitioning strategies. The irregular nature of the structures rules out the usual optimization techniques used with arrays. Hand-coding these irregular and dynamic data structures is error-prone and not easily portable. |
