Scalable parallel coset enumeration: bulk definition and the memory wall

DOI10.1006/JSCO.2002.0523zbMATH Open1017.20021OpenAlexW2016054777MaRDI QIDQ697483FDOQ697483

Authors: Gene Cooperman, V. S. Grinberg 

Publication date: 17 September 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2002.0523

zbMATH Keywords

algorithmsparallelizationTodd-Coxeter coset enumerationmemory wallbulk definitionLyons sporadic groupparallel coset enumeration

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: sporadic groups (20D08)

Cites Work

• Parallel GAP: Mature interactive parallel computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementation and Analysis of the Todd-Coxeter Algorithm
• A practical method for enumerating cosets of a finite abstract group
• On doing Todd-Coxeter coset enumeration in parallel
• Parallel coset enumeration using threads
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on the Todd-Coxeter coset enumeration algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programmierung der Restklassenabzählung einer Gruppe nach Untergruppen

Cited In (1)

• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code

Uses Software

• STAR/MPI
• ParGAP
• TOP-C

This page was built for publication: Scalable parallel coset enumeration: bulk definition and the memory wall

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697483)