This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho
Practical Considerations of Parallel Simulations and Architecture Independent Parallel Algorithm Design
β Scribed by Alexandros V. Gerbessiotis
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 403 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We develop and experiment with a new parallel algorithm to approximate the maximum weight cut in a weighted undirected graph. Our implementation starts with the recent (serial) algorithm of Goemans and Williamson for this problem. We consider several different versions of this algorithm, varying the
computer. The force is calculated with sufficient accuracy for practical MD simulations. The processor also calculates virials simultaneously with forces for use in the calculation of pressure, accommodates periodic boundary conditions, and can be used in Ewald summations. An MD Engine system consis