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

Vladimir Janjic, Christopher Brown, Max Neunhöffer, Kevin Hammond, Steve Linton, Hans Wolfgang Loidl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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,6]. 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 36 on 64 cores).

Original languageEnglish
Title of host publicationParallel Computing
Subtitle of host publicationAccelerating Computational Science and Engineering (CSE)
EditorsMichael Bader, Arndt Bode, Hans-Joachim Bungartz, Michael Gerndt, Gerhard R. Joubert, Frans Peters
PublisherIOS Press
Pages225-232
Number of pages8
Volume25
ISBN (Electronic)9781614993810
ISBN (Print)9781614993803
DOIs
Publication statusPublished - 2014

Publication series

NameAdvances in Parallel Computing
PublisherIOS Press
Volume25
ISSN (Print)0927-5452

Keywords

  • GAP computer algebra system
  • Orbit enumeration
  • Parallel symbolic computation

Fingerprint Dive into the research topics of 'Space exploration using parallel orbits: A study in parallel symbolic computing'. Together they form a unique fingerprint.

Cite this