Implementation of a Numerical Solution of the Multicomponent Kinetic Collection Equation (MKCE) on Parallel Computers
β Scribed by Tamir G. Reisin; Sabine C. Wurzler
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 779 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
Two different numerical solutions of the two-component kinetic collection equation were implemented on parallel computers. The parallelization approach included domain decomposition and MPI commands for communications. Four different parallel codes were tested. A dynamic decomposition based on an occupancy function provided the optimum balance between time performance and flexibility for any number of processors. The occupancy function was defined according to the number of calculations required at each grid point in the domain. Speed-up performance depended very much on the parallel code used and in some cases very good results were obtained for up to 32 processors.
π SIMILAR VOLUMES
The multi-moments method of S. Tzivion, G. Feingold, and Z. Levin was applied to the original kinetic collection equation in order to obtain a set of equations with respect to moments in spectral bins. For solving this set of equations an accurate and efficient method is proposed. The method conserv
A n~mencai so~urmn of a recentI) dented d:sslpatlbe waw equation gavernmg the kmetlcs of spmodal decomposltmn of a Lennard-Jones Ruld 1s presenred In addltron. the r.zsults are compared wrth those of Cahn's and Abraham's generaked dtffusion theories for the case of rhe early stages of the coarsemng
Techniques for solving linear equations on a single instruction multiple data (SIMD) computer such as the ICL DAP have so far been confined to simple methods such as the Successive Overrelaxation and Alternating Direction Implicit algorithms. While these techniques are adequate for simple finite dif