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).
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
Publication
Parallel Computing
ISSN
0927-5452Type
Conference item
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.