Scalable parallel coset enumeration: bulk definition and the memory wall

DOI10.1006/jsco.2002.0523zbMath1017.20021OpenAlexW2016054777MaRDI QIDQ697483

Gene Cooperman, Victor 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) Simple groups: sporadic groups (20D08) 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)

Uses Software

• STAR/MPI
• ParGAP
• TOP-C

Cites Work

• Programmierung der Restklassenabzählung einer Gruppe nach Untergruppen
• On doing Todd-Coxeter coset enumeration in parallel
• Implementation and Analysis of the Todd-Coxeter Algorithm
• A note on the Todd-Coxeter coset enumeration algorithm
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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