report · University of North Texas Digital Library (University of North Texas) · 1996
Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D
Cited by 0Open access
Abstract
Computer simulations using the multi-particle code PARMELA with a three-dimensional point-by-point space charge algorithm have turned out to be very helpful in supporting injector commissioning and operations at Thomas Jefferson National Accelerator Facility (Jefferson Lab, formerly called CEBAF). However, this algorithm, which defines a typical N{sup 2} problem in CPU time scaling, is very time-consuming when N, the number of macro-particles, is large. Therefore, it is attractive to use massively parallel processors (MPPs) to speed up the simulations. Motivated by this, the authors modified the space charge subroutine for using the MPPs of the Cray T3D. The techniques used to parallelize and optimize the code on the T3D are discussed in this paper. The performance of the code on the T3D is examined in comparison with a Parallel Vector Processing supercomputer of the Cray C90 and an HP 735/15 high-end workstation.
Cite this paper
Liu, H. (1996). Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D. University of North Texas Digital Library (University of North Texas). https://doi.org/10.2172/10165690
Liu, H. “Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D.” University of North Texas Digital Library (University of North Texas), 1996, https://doi.org/10.2172/10165690.
Liu, H. 1996. “Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D.” University of North Texas Digital Library (University of North Texas). https://doi.org/10.2172/10165690.
Liu, H. (1996) ‘Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D’, University of North Texas Digital Library (University of North Texas). Available at: https://doi.org/10.2172/10165690.
@article{liu1996space,
title = {{Space-charge-dominated beam dynamics simulations using the massively parallel processors (MPPs) of the Cray T3D}},
author = {Liu, H.},
journal = {University of North Texas Digital Library (University of North Texas)},
year = {1996},
doi = {10.2172/10165690}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
[Detection of Coxiella burnetii in the air of a sheep barn during shearing].
J Schulz, M Runge, C Schröder et al. · PubMed · 2005
Cited by 12
Floating Point Arithmetic Unit with Multi-Precision for DSP Applications
M. Vishnupriya, B. Nancharaiah · International Conference on Electrical, Computer and Communication Technologies (ICECCT) · 2021
Cited by 4
Parallel floating-point expansions for extended-precision GPU computations
Caroline Collange, Mioara Joldeş, Jean‐Michel Muller et al. · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · 2016
Cited by 4Open access
Exploiting the Performance of 32 bit Floating Point Arithmetic in Obtaining 64 bit Accuracy (Revisiting Iterative Refinement for Linear Systems)
Julie Langou, Julien Langou, Piotr Łuszczek et al. · ACM/IEEE Conference on Supercomputing (SC) · 2006
Cited by 92
Exploiting the Performance of 32 bit Floating Point Arithmetic in Obtaining 64 bit Accuracy
Julie Langou, Julien Langou, Piotr Łuszczek et al. · 2006
Cited by 39
Understanding the performance-accuracy tradeoffs of floating-point arithmetic on GPUs
Sruthikesh Surineni, Ruidong Gu, Huyen Nguyen et al. · IEEE International Symposium on Workload Characterization · 2017
Cited by 4
The Impact of Multicore on Math Software and Exploiting Single Precision Computing to Obtain Double Precision Results
Jack J. Dongarra · Lecture notes in computer science · 2006
Cited by 3
A floating-point technique for extending the available precision
T.J. Dekker · Numerische Mathematik · 1971
Cited by 531Open access