Abstract
The computer program SnB implements a direct-methods algorithm, known as Shake-and-Bake, which optimizes trial structures consisting of randomly positioned atoms. Although large Shake-and-Bake applications require significant amounts of computing time, the algorithm can be easily implemented in parallel in order to decrease the real time required to achieve a solution. By using a master-worker model, SnB version 2.2 is amenable to all of the prevalent modern parallel-computing platforms, including (i) shared-memory multiprocessor machines, such as the SGI Origin2000, (ii) distributed-memory multiprocessor machines, such as the IBM SP, and (iii) collections of workstations, including Beowulf clusters. A linear speedup in the processing of a fixed number of trial structures can be obtained on each of these platforms.
| Original language | English |
|---|---|
| Pages (from-to) | 374-376 |
| Number of pages | 3 |
| Journal | Journal of Applied Crystallography |
| Volume | 35 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2002 |
Fingerprint
Dive into the research topics of 'SnB version 2.2: An example of crystallographic multiprocessing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver