Fast multiplication of large permutations for disk, flash memory and RAM

Authors:
Vlad Slavici;Xin Dong;Daniel Kunkle;Gene Cooperman
Affiliations:
Northeastern University, Boston, MA;Northeastern University, Boston, MA;Northeastern University, Boston, MA;Northeastern University, Boston, MA
Venue:
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Year:
2010

Citing 9
Cited 0

Hitting the memory wall: implications of the obvious

ACM SIGARCH Computer Architecture News
Overcoming the memory wall in symbolic algebra: a faster permutation multiplication

ACM SIGSAM Bulletin
Memory-based and disk-based algorithms for very high degree permutation groups

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Twenty-six moves suffice for Rubik's cube

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A disk-based parallel implementation for direct condensation of large permutation modules

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs

Proceedings of the 2007 international workshop on Parallel symbolic computation
Solving Rubik's Cube: disk is the new RAM

Communications of the ACM - The psychology of security: why do good users make bad decisions?
Harnessing parallel disks to solve Rubik's cube

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Permutation multiplication (or permutation composition) is perhaps the simplest of all algorithms in computer science. Yet for large permutations, the standard algorithm is not the fastest for disk or for flash, and surprisingly, it is not even the fastest algorithm for RAM on recent multi-core CPUs. On a recent commodity eight-core machine we demonstrate a novel algorithm that is 50% faster than the traditional algorithm. For larger permutations on flash or disk, the novel algorithm is orders of magnitude faster. A disk-parallel algorithm is demonstrated that can multiply two permutations with 12.8 billion points using 16 parallel local disks of a cluster in under one hour. Such large permutations are important in computational group theory, where they arise as the result of the well-known Todd-Coxeter coset enumeration algorithm. The novel algorithm emphasizes several passes of streaming access to the data instead of the traditional single pass using random access to the data. Similar novel algorithms are presented for permutation inverse and permutation multiplication by an inverse, thus providing a complete library of the underlying permutation operations needed for computations with permutation groups.