Concurrent Computing

Applications in Positron-Matter Interactions

Computing the interaction potential between the positron and the atomic or molecular target requires substantial computing resources. We found that the amount of I/O and cpu time become prohibitive on any standard, sequential (single-node) computer for targets of even moderate size, such as SF6.

A concurrent solution to these problems is now not only feasible, but inexpensive as well. We have constructed a series Mark I-V of Beowulf clusters (named Gamera) each under $15,000, to perform these calculations using our own PATMOL parallel quantum chemistry codes.

  1. Direct 3D Quadrature Scheme (old method on Gamera Mark I)
  2. Performance of Gamera Mark I
  3. Cost of Gamera Mark I
  4. CACR Beowulf Page


This page designed and maintained by t.l. gibson
thomas.gibson@ttu.edu

Gibson Home Page Return to Gibson Home Page