A comparative analysis of parallel disk-based Methods for enumerating implicit graphs

PASCO'07: Proceedings of the 2007 International Workshop on Parallel Symbolic Computation

Volumn , Issue , 2007, Pages 78-87

  Robinson, Eric ^a   Kunkle, Daniel ^a   Cooperman, Gene ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Disk based; Enumeration; Implicit graphs; Parallel; Search

Indexed keywords

ALGEBRA; DATA MINING; INFORMATION RETRIEVAL; PROGRAM PROCESSORS; RANDOM ACCESS STORAGE;

DISK BASED METHODS; ENUMERATION; IMPLICIT GRAPHS; SEARCH TECHNIQUES;

PARALLEL ALGORITHMS;

EID: 36849063090     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1278177.1278190     Document Type: Article

References (24)

1. D. Bitton and D. J. DeWitt. Duplicate record elimination in large data files. ACM Trans. Database Syst., 8(2):255-265, 1983.
2. J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, and R.A. Wilson. Atlas of finite groups. Clarendon Press, Oxford, 1985.
3. G. Cooperman and L. Finkelstein. New methods for using Cayley graphs in interconnection networks. Discrete Applied Mathematics, 37/38:95-118, 1992. (special issue on Interconnection Networks).
4. G. Cooperman, L. Finkelstein, M. Tselman, and B. York. Constructing permutation representations for matrix groups. J. Symbolic Comput., 1997.
5. 4. In Progress In Mathematics, volume 173, pages 161-175. Birkhauser, 1999.
6. G. Cooperman and E. Robinson. Memory-based and disk-based algorithms for very high degree permutation groups. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '03), pages 66-73. ACM Press, 2004.
7. G. Cooperman and M. Tselman. New sequential and parallel algorithms for generating high dimension Hecke algebras using the condensation technique. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '96), pages 155-160. ACM Press, 1996.
8. A. H. Frey Jr. and D. Singmaster. Handbook of Cubik Math. Enslow Publishers, 1982.
9. R. E. Korf. Best-first frontier search with delayed duplicate detection. In AAAI, pages 650-657, 2004.
10. R. E. Korf and P. Schultze. Large-scale parallel breadth-first search. In AAAI, pages 1380-1385, 2005.
11. R. E. Korf, W. Zhang, I. Thayer, and H. Hohwald. Frontier search. J. ACM, 52(5):715-748, 2005.
12. D. Kunkle and G. Cooperman. Twenty-six moves suffice for Rubik's cube. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '07). ACM Press, 2007.
13. F. Lübeck and M. Neunhöffer. Enumerating large orbits and direct condensation. Experiment. Math, 10:197-206, 2001.
14. S. Radu. Solving Rubik's cube in 28 face turns, http://cubezzz.homelinux. org/drupal/?q=node/view/37, 2005.
15. S. Radu. Rubik can be solved in 27f. http://cubezzz.homelinux.org/drupal/ ?q=node/view/53, 2006.
16. M. Reid. New upper bounds, http://www.math.rwth-aachen.de/~Mart in.Schoenert/Cube-Lovers/michael_reid_new_upper.bounds.html, 1995.
17. M. Reid. Superflip requires 20 face turns. http ://www.math.rwth-aachen. de/~Mart in. Schoenert/Cube-Lovers/ michael_reid__superflip_requires_20_face_turns. html, 1995.
18. E. Robinson and G. Cooperman. A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '06), pages 298-305. ACM Press, 2006.
19. E. Robinson, G. Cooperman, and J. Müller. A disk-based parallel implementation for direct condensation of large permutation modules. In Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '07). ACM Press, 2007.
20. A. W. Roscoe. Model-checking CSP. A classical mind: essays in honour of C. A. R. Hoare, pages 353-378, 1994.
21. M. Weller. Construction of large permutation representations for matrix groups. In W. Jäger E. Krause, editor, High Performance Computing in Science and Engineering '98, pages 430-, Springer, 1999.
22. M. Weller. Construction of large permutation representations for matrix groups ii. Applicable Algebra in Engineering, Communication and Computing, 11:463-488, 2001.
23. R. Zhou and E. A. Hansen. Structured duplicate detection in external-memory graph search. In AAAI, pages 683-689, 2004.
24. R. Zhou and E. A. Hansen. Domain-independent structured duplicate detection. In AAAI, 2006.