Domains decomposition

Wilson M R, Allen M P, Warren M A, Sauron A and Smith W 1997 Replicated data and domain decomposition molecular dynamics techniques for the simulation of anisotropic potentials J. Comput. Chem. 18 478-88... 

D. Brown, J. H. R. Clarke, M. Okuda and T. Yamazaki, A domain decomposition strategy for molecular dynamics simulations on distributed memory machines . Comp. Phys. Comm., Vol 74, 67-80, 1993. 

Maday, Y., Mavripilis, C. and Petera, A. T., 1980. Nonconforming mortar element methods application to. spectral discretizations. In Chan, T. F, Glowinski, R., Perianx, J. and Widlund, O. B. (eds). Domain Decomposition Methods, SIAM, Philadelphia, pp. 392- 418. 

Vereurth, R., Non-overlapping domain decomposition methods, in Bristeau,... 

Fig. 5.7 Domain decomposition for a fuel cell stack where each cell is treated as an individual process on a separate computer processor.

As a first step toward overcoming the above problems, a hybrid diffusion-adsorption model for the terrace linked with a KMC model near the steps was developed (Schulze, 2004 Schulze et al., 2003). This domain decomposition stems from a natural separation of scales. The continuum terrace model between steps is... 

The previous section has shown that turbulence combined with a different domain decomposition (i.e. a different number of processors for the following) is sufEcient to lead to totally different instantaneous flow realizations. It is expected that a perturbation in initial conditions will have the same effect as domain decomposition. This is verified in runs TC3 and TC4 which are run on one processor only, thereby eliminating issues linked to parallel implementation. The only difference between TC3 and TC4 is that in TC4, the initial solution is identical to TC3 except at one random point where a 10 perturbation is applied to the streamwise velocity component. Simulations with different locations of the perturbation were run to ensure that their position did not affect results. 

Brown, Clarke, Okuda, and Yamazaki also adopted a domain decomposition parallelization strategy on the Fujitsu API 000 machine. " They describe an algorithm that is a development of a spatial decomposition technique due to Liem and co-workers but incorporated decomposition of three-dimensional space in all three dimensions with linked-cell and neighbor table techniques for enhanced efficiency. Communications between processors were minimized without incurring the penalties associated with redundant force calculation. 

Domain Decomposition The breakdown of a problem into separate processes for parallel execution based on the regularity in the data structures of the application. 

Applying the domain decomposition algorithm at this level, we get an interaction region that has side 2.5rc and Vi/Vj = 47t/46.875 0.27. The subdivision process may be continued recursively, but eventually most cells will be empty which entails unwanted overhead. 

It should be clear from the above that there are a number of variations of the basic domain decomposition algorithm for short-range interaction and there is still a lot of room for improvement both in the methods and the implementations. 

The domain decomposition algorithm described in Section 4.4.1 can be parallelized in a number of different ways. The MD algorithm contains opportunities for independent operations on several different levels. In principle, the interaction on each particle can be calculated independently of all the others and the same goes for time-integration. For an in-depth discussion of these issues we refer to the review by Fincham [97,98]. This fine-grain parallelism is not really used in... 

D. Brown, H. Minoux, and B. Maigret, A domain decomposition parallel processing algorithm for molecular dynamics simulations of systems of arbitrary connectivity, Comput. Phys. Commun., 103 (1997), 170-186. 

Studies on the refinement of the method especially in connection with domain decomposition are currently in progress. ... 

Domain decomposition with sliding meshes. This strategy is very popular in the finite volume literature and implemented in finite volume-based software (Fluent , CFX , and Star-CD ). The idea is to decompose the flow domain into several concentric cylindrical meshes and allow slipping of the meshes between the partitions. The continuity of the solution at the mesh interface is imposed by... 

---