Skip to content
Free planNo credit card requiredStart writing

article · 2002

multiprocessing

A Martins Innus, B Charles M. Weeksc, Russ Millera

Cited by 0Abstract and details only

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 signi®cant 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 multi-processor 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 ®xed number of trial structures can be obtained on each of these platforms. 1.

Cite this paper

APA 7

Innus, A. M., Weeksc, B. C. M., & Millera, R. (2002). multiprocessing.

MLA 9

Innus, A Martins, et al. “multiprocessing.” 2002.

Chicago

Innus, A Martins, B Charles M. Weeksc, and Russ Millera. 2002. “multiprocessing.”

Harvard

Innus, A.M., Weeksc, B.C.M. and Millera, R. (2002) ‘multiprocessing’.

BibTeX
@article{innus2002multiprocessing,
  title = {{multiprocessing}},
  author = {Innus, A Martins and Weeksc, B Charles M. and Millera, Russ},
  year = {2002}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.