Space exploration using parallel orbits: a study in parallel symbolic computing

Vladimir Janjic; Christopher Mark Brown; Max Neunhoeffer; Kevin Hammond; Stephen Alexander Linton; Hans-Wolfgang Loidl

doi:10.3233/978-1-61499-381-0-225

Space exploration using parallel orbits: a study in parallel symbolic computing

Vladimir Janjic, Christopher Mark Brown, Max Neunhoeffer, Kevin Hammond, Stephen Alexander Linton, Hans-Wolfgang Loidl

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

Abstract

Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new shared-memory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64-core shared-memory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).

Original language	English
Title of host publication	Parallel Computing
Subtitle of host publication	Accelerating Computational Science and Engineering (CSE)
Editors	Michael Bader, Arndt Bode, Hans-Joachim Bungartz, Michael Gerndt, Gerhard R. Joubert, Frans Peters
Publisher	IOS Press
Pages	225-232
Number of pages	8
Volume	25
ISBN (Electronic)	978-1-61499-381-0
ISBN (Print)	978-1-61499-380-3
DOIs	https://doi.org/10.3233/978-1-61499-381-0-225
Publication status	Published - Sept 2013

Publication series

Name	Advances in Parallel Computing
Publisher	IOS Press
ISSN (Print)	0927-5452
ISSN (Electronic)	1879-808X

Keywords

Symbolic computation
Orbit calculation
Skeleton
Parallelism

Access to Document

10.3233/978-1-61499-381-0-225

Hammond_2013_IOS_Space_AccMan
© 2013, IOS Press. This work is made available online with express permission from the publisher. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at www.iospress.nl. Parallel Computing: Accelerating Computational Science and Engineering (CSE), Janjic, V., Brown, C. M., Neunhoeffer, M., Hammond, K., Linton, S. A. & Loidl, H-W., 225 – 232, Copyright (2013) with permission from IOS Press.
Accepted author manuscript, 168 KB

Cite this

Janjic, V., Brown, C. M., Neunhoeffer, M., Hammond, K., Linton, S. A., & Loidl, H.-W. (2013). Space exploration using parallel orbits: a study in parallel symbolic computing. In M. Bader, A. Bode, H.-J. Bungartz, M. Gerndt, G. R. Joubert, & F. Peters (Eds.), Parallel Computing: Accelerating Computational Science and Engineering (CSE) (Vol. 25, pp. 225-232). (Advances in Parallel Computing). IOS Press. https://doi.org/10.3233/978-1-61499-381-0-225

Janjic, Vladimir ; Brown, Christopher Mark ; Neunhoeffer, Max et al. / Space exploration using parallel orbits : a study in parallel symbolic computing. Parallel Computing: Accelerating Computational Science and Engineering (CSE). editor / Michael Bader ; Arndt Bode ; Hans-Joachim Bungartz ; Michael Gerndt ; Gerhard R. Joubert ; Frans Peters. Vol. 25 IOS Press, 2013. pp. 225-232 (Advances in Parallel Computing).

@inproceedings{298cd75b43b941469558766c8c2e4e96,

title = "Space exploration using parallel orbits: a study in parallel symbolic computing",

abstract = "Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new shared-memory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64-core shared-memory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).",

keywords = "Symbolic computation, Orbit calculation, Skeleton, Parallelism",

author = "Vladimir Janjic and Brown, {Christopher Mark} and Max Neunhoeffer and Kevin Hammond and Linton, {Stephen Alexander} and Hans-Wolfgang Loidl",

year = "2013",

month = sep,

doi = "10.3233/978-1-61499-381-0-225",

language = "English",

isbn = "978-1-61499-380-3",

volume = "25",

series = "Advances in Parallel Computing",

publisher = "IOS Press",

pages = "225--232",

editor = "Bader, { Michael} and Arndt Bode and Hans-Joachim Bungartz and Michael Gerndt and Joubert, {Gerhard R.} and Frans Peters",

booktitle = "Parallel Computing",

address = "Netherlands",

}

Janjic, V, Brown, CM, Neunhoeffer, M, Hammond, K, Linton, SA & Loidl, H-W 2013, Space exploration using parallel orbits: a study in parallel symbolic computing. in M Bader, A Bode, H-J Bungartz, M Gerndt, GR Joubert & F Peters (eds), Parallel Computing: Accelerating Computational Science and Engineering (CSE). vol. 25, Advances in Parallel Computing, IOS Press, pp. 225-232. https://doi.org/10.3233/978-1-61499-381-0-225

Space exploration using parallel orbits: a study in parallel symbolic computing. / Janjic, Vladimir; Brown, Christopher Mark; Neunhoeffer, Max et al.
Parallel Computing: Accelerating Computational Science and Engineering (CSE). ed. / Michael Bader; Arndt Bode; Hans-Joachim Bungartz; Michael Gerndt; Gerhard R. Joubert; Frans Peters. Vol. 25 IOS Press, 2013. p. 225-232 (Advances in Parallel Computing).

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

TY - GEN

T1 - Space exploration using parallel orbits

T2 - a study in parallel symbolic computing

AU - Janjic, Vladimir

AU - Brown, Christopher Mark

AU - Neunhoeffer, Max

AU - Hammond, Kevin

AU - Linton, Stephen Alexander

AU - Loidl, Hans-Wolfgang

PY - 2013/9

Y1 - 2013/9

N2 - Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new shared-memory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64-core shared-memory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).

AB - Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new shared-memory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64-core shared-memory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).

KW - Symbolic computation

KW - Orbit calculation

KW - Skeleton

KW - Parallelism

UR - http://www.iospress.nl

U2 - 10.3233/978-1-61499-381-0-225

DO - 10.3233/978-1-61499-381-0-225

M3 - Conference contribution

SN - 978-1-61499-380-3

VL - 25

T3 - Advances in Parallel Computing

SP - 225

EP - 232

BT - Parallel Computing

A2 - Bader, Michael

A2 - Bode, Arndt

A2 - Bungartz, Hans-Joachim

A2 - Gerndt, Michael

A2 - Joubert, Gerhard R.

A2 - Peters, Frans

PB - IOS Press

ER -

Janjic V, Brown CM, Neunhoeffer M, Hammond K, Linton SA, Loidl HW. Space exploration using parallel orbits: a study in parallel symbolic computing. In Bader M, Bode A, Bungartz HJ, Gerndt M, Joubert GR, Peters F, editors, Parallel Computing: Accelerating Computational Science and Engineering (CSE). Vol. 25. IOS Press. 2013. p. 225-232. (Advances in Parallel Computing). doi: 10.3233/978-1-61499-381-0-225

Space exploration using parallel orbits: a study in parallel symbolic computing

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

ParaPhrase FP7-ICT-2011-7: EU FP7 'ParaPhrase'

HPC-GAP: High performance computational: HPC-GAP High Performance Computational Algebra and Discrete Mathematics

Cite this

Space exploration using parallel orbits: a study in parallel symbolic computing

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Projects

ParaPhrase FP7-ICT-2011-7: EU FP7 'ParaPhrase'

HPC-GAP: High performance computational: HPC-GAP High Performance Computational Algebra and Discrete Mathematics

Cite this