ICAP2012 - List of Keywords (target)

Paper	Title	Other Keywords	Page
MOSDC2	GPGPU Implementation of Matrix Formalism for Beam Dynamics Simulation	simulation, controls	59
	N.V. Kulabukhova St. Petersburg State University, St. Petersburg, Russia
	Matrix formalism is a map integration method for ODE solving. It allows to present solution of the system as sums and multiplications of 2-indexes numeric matrix. This approach can be easy implement in parallel codes. As the most natural for matrix operation GPU architecture has been choosen. The set of the methods for beam dynamics has been implemented. Particles and envelope dynamics are supported. The computing facilities are located in St. Petersburg State University and presented by the NVIDIA Tesla clusters.
	Slides MOSDC2 [0.770 MB]

WEAAI1	Bringing Large-scale Analytics to Accelerators	EPICS, controls, monitoring, linac	116
	N. Malitsky BNL, Upton, Long Island, New York, USA
	The report presents a new approach for storing and processing both the accelerator control data and the experimental results. It is based on the analysis and consolidation of several modern technologies, such as the EPICS control infrastructure, the SciDB array-oriented data management and analytics platform, the HDF5 file format, and others. The paper overviews the different features of the proposed system and the development of analytics algorithms in the context of the modern light source facilities.
	Slides WEAAI1 [2.505 MB]

THP06	An OpenMP Parallelisation of Real-time Processing of CERN LHC Beam Position Monitor Data	controls, insertion, HOM, non-linear-dynamics	230
	H. Renshall, L. Deniau CERN, Geneva, Switzerland
	SUSSIX is a FORTRAN program for the post processing of turn-by-turn Beam Position Monitor (BPM) data, which computes the frequency, amplitude, and phase of tunes and resonant lines to a high degree of precision. For analysis of LHC BPM data a specific version run through a C steering code has been implemented in the CERN Control Centre to run on a server under the Linux operating system but became a real time computational bottleneck preventing truly on-line study of the BPM data. Timing studies showed that the independent processing of each BPMs data was a candidate for parallelization and the OpenMP package with its simple insertion of compiler directives was tried. It proved to be easy to learn and use, problem free and efficient in this case reaching a factor of ten reduction in real-time over twelve cores on a dedicated server. This paper reviews the problem, shows the critical code fragments with their OpenMP directives and the results obtained.

THSCC3	On Accelerator Driven Subcritical Reactor Power Gain	neutron, proton, feedback, coupling	259
	A.G. Golovkina, I.V. Kudinovich, D.A. Ovsyannikov St. Petersburg State University, St. Petersburg, Russia
	The accelerator driven system (ADS) with subcritical reactor is considered. Such systems demonstrate high safety, due to the fact, that the reactor operates at sub-critical level. The problem of the reactor power rate maximiztion on fixed values of effective multiplication factor and the external neutron supply (neutron generating target) intensity is studied. In this paper the main attention is paid to the reactor core optimization. Some ways of ADS power rate gain and optimized reactor core parameters are proposed.
	Slides THSCC3 [1.857 MB]

FRSAC2	Comparison of Eigenvalue Solvers for Large Sparse Matrix Pencils	cavity, simulation, electromagnetic-fields, superconducting-cavity	287
	F. Yaman, W. Ackermann, T. Weiland TEMF, TU Darmstadt, Darmstadt, Germany
	Funding: Work supported by the DFG through SFB 634 Efficient and accurate computation of eigenvalues and eigenvectors is of fundamental importance in the accelerator physics community. Moreover, the eigensystem analysis is generally used for the identifications of many physical phenomena connected to vibrations. Therefore, various types of algorithms such that Arnoldi, Lanczos, Krylov-Schur, Jacobi-Davidson etc. were implemented to solve the eigenvalue problem efficiently. In this direction, we investigate the performance of selected commercial and freely available software tools for the solution of a generalized eigenvalue problem. We choose two setups by considering spherical and billiard resonators in order to test the robustness, accuracy, and computational speed and memory consumption issues of the recent versions of CST, Matlab, Pysparse, SLEPc and CEM3D. Simulations were performed on a standard personal computer as well as on a cluster computer to enable the handling of large sparse matrices in the order of hundreds of thousands up to several millions degrees of freedom. We obtain interesting comparison results with the examined solvers which is useful for choosing the appropriate solvers for a given practical application.
	Slides FRSAC2 [10.095 MB]

Paper

Title

Other Keywords

Page

MOSDC2

GPGPU Implementation of Matrix Formalism for Beam Dynamics Simulation

simulation, controls

59

N.V. Kulabukhova
St. Petersburg State University, St. Petersburg, Russia

Matrix formalism is a map integration method for ODE solving. It allows to present solution of the system as sums and multiplications of 2-indexes numeric matrix. This approach can be easy implement in parallel codes. As the most natural for matrix operation GPU architecture has been choosen. The set of the methods for beam dynamics has been implemented. Particles and envelope dynamics are supported. The computing facilities are located in St. Petersburg State University and presented by the NVIDIA Tesla clusters.

Slides MOSDC2 [0.770 MB]

WEAAI1

Bringing Large-scale Analytics to Accelerators

EPICS, controls, monitoring, linac

116

N. Malitsky
BNL, Upton, Long Island, New York, USA

The report presents a new approach for storing and processing both the accelerator control data and the experimental results. It is based on the analysis and consolidation of several modern technologies, such as the EPICS control infrastructure, the SciDB array-oriented data management and analytics platform, the HDF5 file format, and others. The paper overviews the different features of the proposed system and the development of analytics algorithms in the context of the modern light source facilities.

Slides WEAAI1 [2.505 MB]

THP06

An OpenMP Parallelisation of Real-time Processing of CERN LHC Beam Position Monitor Data

controls, insertion, HOM, non-linear-dynamics

230

H. Renshall, L. Deniau
CERN, Geneva, Switzerland

SUSSIX is a FORTRAN program for the post processing of turn-by-turn Beam Position Monitor (BPM) data, which computes the frequency, amplitude, and phase of tunes and resonant lines to a high degree of precision. For analysis of LHC BPM data a specific version run through a C steering code has been implemented in the CERN Control Centre to run on a server under the Linux operating system but became a real time computational bottleneck preventing truly on-line study of the BPM data. Timing studies showed that the independent processing of each BPMs data was a candidate for parallelization and the OpenMP package with its simple insertion of compiler directives was tried. It proved to be easy to learn and use, problem free and efficient in this case reaching a factor of ten reduction in real-time over twelve cores on a dedicated server. This paper reviews the problem, shows the critical code fragments with their OpenMP directives and the results obtained.

THSCC3

On Accelerator Driven Subcritical Reactor Power Gain

neutron, proton, feedback, coupling

259

A.G. Golovkina, I.V. Kudinovich, D.A. Ovsyannikov
St. Petersburg State University, St. Petersburg, Russia

The accelerator driven system (ADS) with subcritical reactor is considered. Such systems demonstrate high safety, due to the fact, that the reactor operates at sub-critical level. The problem of the reactor power rate maximiztion on fixed values of effective multiplication factor and the external neutron supply (neutron generating target) intensity is studied. In this paper the main attention is paid to the reactor core optimization. Some ways of ADS power rate gain and optimized reactor core parameters are proposed.

Slides THSCC3 [1.857 MB]

FRSAC2

Comparison of Eigenvalue Solvers for Large Sparse Matrix Pencils

cavity, simulation, electromagnetic-fields, superconducting-cavity

287

F. Yaman, W. Ackermann, T. Weiland
TEMF, TU Darmstadt, Darmstadt, Germany

Funding: Work supported by the DFG through SFB 634
Efficient and accurate computation of eigenvalues and eigenvectors is of fundamental importance in the accelerator physics community. Moreover, the eigensystem analysis is generally used for the identifications of many physical phenomena connected to vibrations. Therefore, various types of algorithms such that Arnoldi, Lanczos, Krylov-Schur, Jacobi-Davidson etc. were implemented to solve the eigenvalue problem efficiently. In this direction, we investigate the performance of selected commercial and freely available software tools for the solution of a generalized eigenvalue problem. We choose two setups by considering spherical and billiard resonators in order to test the robustness, accuracy, and computational speed and memory consumption issues of the recent versions of CST, Matlab, Pysparse, SLEPc and CEM3D. Simulations were performed on a standard personal computer as well as on a cluster computer to enable the handling of large sparse matrices in the order of hundreds of thousands up to several millions degrees of freedom. We obtain interesting comparison results with the examined solvers which is useful for choosing the appropriate solvers for a given practical application.

Slides FRSAC2 [10.095 MB]