In this paper we elaborate on some of the calculations and address related problems for some three-generator groups with exponent six. Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating finitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. Coset enumeration is one of the basic tools for investigating finitely presented groups.
Many enumerations require significant resources, in terms of CPU time or memory space.
Our results can equally well be applied to any master-slave parallel activity exhibiting a medium level of granularity.