Files in this item
Space exploration using parallel orbits : a study in parallel symbolic computing
Item metadata
dc.contributor.author | Janjic, Vladimir | |
dc.contributor.author | Brown, Christopher Mark | |
dc.contributor.author | Neunhoeffer, Max | |
dc.contributor.author | Hammond, Kevin | |
dc.contributor.author | Linton, Stephen Alexander | |
dc.contributor.author | Loidl, Hans-Wolfgang | |
dc.contributor.editor | Bader, Michael | |
dc.contributor.editor | Bode, Arndt | |
dc.contributor.editor | Bungartz, Hans-Joachim | |
dc.contributor.editor | Gerndt, Michael | |
dc.contributor.editor | Joubert, Gerhard R. | |
dc.contributor.editor | Peters, Frans | |
dc.date.accessioned | 2014-09-01T14:31:03Z | |
dc.date.available | 2014-09-01T14:31:03Z | |
dc.date.issued | 2013-09 | |
dc.identifier | 71226245 | |
dc.identifier | 298cd75b-43b9-4146-9558-766c8c2e4e96 | |
dc.identifier | 84902284588 | |
dc.identifier.citation | 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 , Advances in Parallel Computing , IOS Press , pp. 225-232 . https://doi.org/10.3233/978-1-61499-381-0-225 | en |
dc.identifier.isbn | 978-1-61499-380-3 | |
dc.identifier.isbn | 978-1-61499-381-0 | |
dc.identifier.issn | 0927-5452 | |
dc.identifier.other | ORCID: /0000-0002-4326-4562/work/33080455 | |
dc.identifier.other | ORCID: /0000-0001-6030-2885/work/70619177 | |
dc.identifier.uri | https://hdl.handle.net/10023/5303 | |
dc.description.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). | |
dc.format.extent | 8 | |
dc.format.extent | 172218 | |
dc.language.iso | eng | |
dc.publisher | IOS Press | |
dc.relation.ispartof | Parallel Computing | en |
dc.relation.ispartofseries | Advances in Parallel Computing | en |
dc.subject | Symbolic computation | en |
dc.subject | Orbit calculation | en |
dc.subject | Skeleton | en |
dc.subject | Parallelism | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject.lcc | QA75 | en |
dc.title | Space exploration using parallel orbits : a study in parallel symbolic computing | en |
dc.type | Conference item | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | https://doi.org/10.3233/978-1-61499-381-0-225 | |
dc.identifier.url | http://www.iospress.nl | en |
dc.identifier.grantnumber | FP&-ICT-2011-7 | en |
dc.identifier.grantnumber | EP/G055181/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.