### 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 language | English |
---|---|

Title of host publication | Advances in Parallel Computing |

Publisher | Elsevier |

Pages | 225-232 |

Number of pages | 8 |

Volume | 25 |

ISBN (Print) | 9781614993803 |

DOIs | |

Publication status | Published - 1 Jan 2014 |

### Publication series

Name | Advances in Parallel Computing |
---|---|

Volume | 25 |

ISSN (Print) | 09275452 |

### Keywords

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

### ASJC Scopus subject areas

- Computer Science(all)

## 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

*Advances in Parallel Computing*(Vol. 25, pp. 225-232). (Advances in Parallel Computing; Vol. 25). Elsevier. https://doi.org/10.3233/978-1-61499-381-0-225