Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorJanjic, Vladimir
dc.contributor.authorBrown, Christopher Mark
dc.contributor.authorNeunhoeffer, Max
dc.contributor.authorHammond, Kevin
dc.contributor.authorLinton, Stephen Alexander
dc.contributor.authorLoidl, Hans-Wolfgang
dc.contributor.editorBader, Michael
dc.contributor.editorBode, Arndt
dc.contributor.editorBungartz, Hans-Joachim
dc.contributor.editorGerndt, Michael
dc.contributor.editorJoubert, Gerhard R.
dc.contributor.editorPeters, Frans
dc.date.accessioned2014-09-01T14:31:03Z
dc.date.available2014-09-01T14:31:03Z
dc.date.issued2013-09
dc.identifier.citationJanjic , 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-225en
dc.identifier.isbn978-1-61499-380-3
dc.identifier.isbn978-1-61499-381-0
dc.identifier.issn0927-5452
dc.identifier.otherPURE: 71226245
dc.identifier.otherPURE UUID: 298cd75b-43b9-4146-9558-766c8c2e4e96
dc.identifier.otherScopus: 84902284588
dc.identifier.otherORCID: /0000-0002-4326-4562/work/33080455
dc.identifier.otherORCID: /0000-0001-6030-2885/work/70619177
dc.identifier.urihttps://hdl.handle.net/10023/5303
dc.description.abstractOrbit 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.extent8
dc.language.isoeng
dc.publisherIOS Press
dc.relation.ispartofParallel Computingen
dc.relation.ispartofseriesAdvances in Parallel Computingen
dc.rights© 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.en
dc.subjectSymbolic computationen
dc.subjectOrbit calculationen
dc.subjectSkeletonen
dc.subjectParallelismen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleSpace exploration using parallel orbits : a study in parallel symbolic computingen
dc.typeConference itemen
dc.contributor.sponsorEuropean Commissionen
dc.contributor.sponsorEPSRCen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.identifier.doihttps://doi.org/10.3233/978-1-61499-381-0-225
dc.identifier.urlhttp://www.iospress.nlen
dc.identifier.grantnumberFP&-ICT-2011-7en
dc.identifier.grantnumberEP/G055181/1en


This item appears in the following Collection(s)

Show simple item record