A Comparison of Implicit and Explicit Parallel Programming
β Scribed by Vincent W. Freeh
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 329 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
a Only synchronization is termination detection. All shared data are read-only. b Edge sharing with neighbors. Compute maximum change between iterations. c Fork/join parallelism. No data sharing. d Decreasing work. Every iteration disseminate values to all. e Variable amount of work.
π SIMILAR VOLUMES
## Abstract The numerical solution of Maxwell's curl equations in the time domain is achieved by combining an unstructured mesh finite element algorithm with a cartesian finite difference method. The practical problem area selected to illustrate the application of the approach is the simulation of
As a test for comparing explicit and implicit treatments of solvation, conformational analyses of the octapeptide angiotensin II have been carried out using molecular dynamics and Monte Carlo simulations. The molecular dynamics treatment uses an explicit atomic description of the solvent whereas a s
A study is presented of the implementation of four different parallel programming models in a code that solves the fluid flow equations on block structured meshes. Performance results obtained on a number of distributed-memory parallel computer systems are given, in particular, for a 1024 processor