Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel Coset Enumeration Using Threads (0)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ramsay, Colin Havas, George |
| Description | Computer Mathematics, Proceedings of the Fourth Asian Symposium (ASCM'2000), Lectures Notes Series on Computing #8, World Scienti |
| Abstract | 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. We develop a fully functional parallel coset enumeration procedure and we discuss some of the issues involved in such parallelisation using the POSIX threads library. Our results can equally well be applied to any master-slave parallel activity exhibiting a medium level of granularity. 1 Introduction Coset enumeration is long established as a technique for the investigation of finitely presented groups. It takes a finitely presented group and a finitely presented subgroup as input, and attempts to find the index of the subgroup in the whole group. In principle, it will succeed whenever this index is finite. Coset enumeration was used well before the days of electronic computers, apparently first by Moore [11], and was popularised by Todd and Coxeter [15]. The first computer implementation was that of Haselg... |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Coset Enumeration Electronic Computer First Computer Implementation Posix Thread Library Functional Parallel Coset Enumeration Procedure Significant Resource Introduction Coset Enumeration Basic Tool Parallel Coset Enumeration Using Thread Medium Level Many Enumeration Memory Space Master-slave Parallel Activity Whole Group Cpu Time |
| Content Type | Text |
| Resource Type | Proceeding |
