Projects per year
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 sharedmemory 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 64core sharedmemory 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, HansJoachim Bungartz, Michael Gerndt, Gerhard R. Joubert, Frans Peters 
Publisher  IOS Press 
Pages  225232 
Number of pages  8 
Volume  25 
ISBN (Electronic)  9781614993810 
ISBN (Print)  9781614993803 
DOIs  
Publication status  Published  Sept 2013 
Publication series
Name  Advances in Parallel Computing 

Publisher  IOS Press 
ISSN (Print)  09275452 
ISSN (Electronic)  1879808X 
Keywords
 Symbolic computation
 Orbit calculation
 Skeleton
 Parallelism
Fingerprint
Dive into the research topics of 'Space exploration using parallel orbits: a study in parallel symbolic computing'. Together they form a unique fingerprint.Projects
 2 Finished


HPCGAP: High performance computational: HPCGAP High Performance Computational Algebra and Discrete Mathematics
Linton, S. A., Gent, I. P. & Hammond, K.
1/09/09 → 28/02/14
Project: Standard