Parallel algorithms for collective processes in high intensity rings

Andrei Shishlo; Jeff Holmes; Viatcheslav Danilov

doi:10.1007/3-540-47789-6_34

Parallel algorithms for collective processes in high intensity rings

Andrei Shishlo, Jeff Holmes, Viatcheslav Danilov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Computational three-dimensional space charge (3DSC) and wake field force algorithms were developed and implemented into the ORBIT computer code to simulate the dynamics of present and planned high intensity rings, such as PSR, Fermilab Booster, AGS Booster, Spallation Neutron Source (SNS), and proton driver. To provide affordable simulation times, the 3DSC algorithm developed for ORBIT has been parallelized and implemented as a separate module into the UAL 1.0 library, which supports a parallel environment based on MPI. The details of these algorithms and their parallel implementation are presented, and results demonstrating the scaling with problem size and number of processors are discussed.

Original language	English
Title of host publication	Computational Science, ICCS 2002 - International Conference, Proceedings
Publisher	Springer Verlag
Pages	325-333
Number of pages	9
Edition	PART 3
ISBN (Print)	3540435948, 9783540435945
DOIs	https://doi.org/10.1007/3-540-47789-6_34
State	Published - 2002
Externally published	Yes
Event	International Conference on Computational Science, ICCS 2002 - Amsterdam, Netherlands Duration: Apr 21 2002 → Apr 24 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 3
Volume	2331 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Computational Science, ICCS 2002
Country/Territory	Netherlands
City	Amsterdam
Period	04/21/02 → 04/24/02

Access to Document

10.1007/3-540-47789-6_34

Cite this

Shishlo, A., Holmes, J., & Danilov, V. (2002). Parallel algorithms for collective processes in high intensity rings. In Computational Science, ICCS 2002 - International Conference, Proceedings (PART 3 ed., pp. 325-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2331 LNCS, No. PART 3). Springer Verlag. https://doi.org/10.1007/3-540-47789-6_34

Shishlo, Andrei ; Holmes, Jeff ; Danilov, Viatcheslav. / Parallel algorithms for collective processes in high intensity rings. Computational Science, ICCS 2002 - International Conference, Proceedings. PART 3. ed. Springer Verlag, 2002. pp. 325-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).

@inproceedings{68df4e56181a4bcfae2d64cc551ccfa8,

title = "Parallel algorithms for collective processes in high intensity rings",

abstract = "Computational three-dimensional space charge (3DSC) and wake field force algorithms were developed and implemented into the ORBIT computer code to simulate the dynamics of present and planned high intensity rings, such as PSR, Fermilab Booster, AGS Booster, Spallation Neutron Source (SNS), and proton driver. To provide affordable simulation times, the 3DSC algorithm developed for ORBIT has been parallelized and implemented as a separate module into the UAL 1.0 library, which supports a parallel environment based on MPI. The details of these algorithms and their parallel implementation are presented, and results demonstrating the scaling with problem size and number of processors are discussed.",

author = "Andrei Shishlo and Jeff Holmes and Viatcheslav Danilov",

year = "2002",

doi = "10.1007/3-540-47789-6_34",

language = "English",

isbn = "3540435948",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 3",

pages = "325--333",

booktitle = "Computational Science, ICCS 2002 - International Conference, Proceedings",

edition = "PART 3",

note = "International Conference on Computational Science, ICCS 2002 ; Conference date: 21-04-2002 Through 24-04-2002",

}

Shishlo, A, Holmes, J & Danilov, V 2002, Parallel algorithms for collective processes in high intensity rings. in Computational Science, ICCS 2002 - International Conference, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 2331 LNCS, Springer Verlag, pp. 325-333, International Conference on Computational Science, ICCS 2002, Amsterdam, Netherlands, 04/21/02. https://doi.org/10.1007/3-540-47789-6_34

Parallel algorithms for collective processes in high intensity rings. / Shishlo, Andrei; Holmes, Jeff; Danilov, Viatcheslav.
Computational Science, ICCS 2002 - International Conference, Proceedings. PART 3. ed. Springer Verlag, 2002. p. 325-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2331 LNCS, No. PART 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Parallel algorithms for collective processes in high intensity rings

AU - Shishlo, Andrei

AU - Holmes, Jeff

AU - Danilov, Viatcheslav

PY - 2002

Y1 - 2002

N2 - Computational three-dimensional space charge (3DSC) and wake field force algorithms were developed and implemented into the ORBIT computer code to simulate the dynamics of present and planned high intensity rings, such as PSR, Fermilab Booster, AGS Booster, Spallation Neutron Source (SNS), and proton driver. To provide affordable simulation times, the 3DSC algorithm developed for ORBIT has been parallelized and implemented as a separate module into the UAL 1.0 library, which supports a parallel environment based on MPI. The details of these algorithms and their parallel implementation are presented, and results demonstrating the scaling with problem size and number of processors are discussed.

AB - Computational three-dimensional space charge (3DSC) and wake field force algorithms were developed and implemented into the ORBIT computer code to simulate the dynamics of present and planned high intensity rings, such as PSR, Fermilab Booster, AGS Booster, Spallation Neutron Source (SNS), and proton driver. To provide affordable simulation times, the 3DSC algorithm developed for ORBIT has been parallelized and implemented as a separate module into the UAL 1.0 library, which supports a parallel environment based on MPI. The details of these algorithms and their parallel implementation are presented, and results demonstrating the scaling with problem size and number of processors are discussed.

UR - http://www.scopus.com/inward/record.url?scp=84886838687&partnerID=8YFLogxK

U2 - 10.1007/3-540-47789-6_34

DO - 10.1007/3-540-47789-6_34

M3 - Conference contribution

AN - SCOPUS:84886838687

SN - 3540435948

SN - 9783540435945

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 325

EP - 333

BT - Computational Science, ICCS 2002 - International Conference, Proceedings

PB - Springer Verlag

T2 - International Conference on Computational Science, ICCS 2002

Y2 - 21 April 2002 through 24 April 2002

ER -

Shishlo A, Holmes J, Danilov V. Parallel algorithms for collective processes in high intensity rings. In Computational Science, ICCS 2002 - International Conference, Proceedings. PART 3 ed. Springer Verlag. 2002. p. 325-333. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). doi: 10.1007/3-540-47789-6_34

Parallel algorithms for collective processes in high intensity rings

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this