Abstract
Efficient space and time exploitation of symmetry in domains on highly parallel, distributed-memory architecture is, in certain cases, equivalent to routing along a labeled group action graph, with computation associated with each group element label, where the group of symmetries acts on the processors. The algebraic structure of the group can sometimes be analyzed to determine, a priori, space and time efficient routing schedules on the hardware network (which, in practice, is often another group action graph). The algorithms we develop were implemented on a 64K-processor CM-2 and used to solve certain natural classes of chess endgames, part of whose search space is invariant under a noncommutative crystallographic group. This program runs 400 times faster than any previous implementation, and discovered many interesting new results in the area; some of these results are not solvable in practice with current serial techniques because the time and space requirements are too large. It seems interesting that it was possible, albeit with difficulty, to implement efficiently certain irregular chess rules on the CM-2, which is optimized for regular data sets.
Similar content being viewed by others
References
Annexstein, F., Baumslag, M., and Rosenberg, A.L. 1987. Group action graphs and parallel architectures. COINS Tech. Rept. 87-133, Univ. of Mass.
Hillis, D., and Taylor, W. 1990. Exploiting symmetry in high-dimensional finite-difference calculations. J. Parallel and Distributed Computing, 8, 1 (Jan.), 77–79.
Johnsson, S.L. 1987. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel and Distributed Computing, 4, 2 (Apr.), 133–172.
Massalin, H. 1987. Superoptimizer—A look at the smallest program. In Proc., Second Internat. Conf. on Architectural Support for Programming Languages and Operating Systems (Palo Alto, Calif., Oct. 5–8), IEEE Comp. Soc. Press, pp. 122–126.
Michie, D., and Bratko, I. 1987. Ideas on knowledge synthesis stemming from the KBBKN endgame. Internat. Comp. Chess Assoc. J., 10, 1 (Mar.), 3–10.
Spanier, E.H. 1966. Algebraic Topology. Springer-Verlag, New York.
Stiller, L. 1988. Massively parallel retrograde endgame analysis. Tech. Rept. BU-CS TR88-014, Boston Univ., Comp. Sci. Dept.
Stiller, L. 1989. Parallel analysis of certain endgames. Internat. Comp. Chess Assoc. J., 12, 2 (June), 55–64.
Thinking Machines. 1990. Connection Machine Model CM-2 Technical Summary. Thinking Machines Corp., Cambridge, Mass.
Thompson, K. 1986. Retrograde analysis of certain endgames. Internat. Comp. Chess Assoc. J., 9, 3 (Sept.), 131–139.
van den Herik, H.J., and Herschberg, I.S. 1985. The construction of an omniscient endgame database. Internat. Comp. Chess Assoc. J., 8, 2 (June), 66–87.
White, A.T. 1984. Graphs, Groups, and Surfaces. North-Holland, Amsterdam.
Author information
Authors and Affiliations
Additional information
Partially supported by NSF/DARPA Grant CCR-8908092.
Rights and permissions
About this article
Cite this article
Stiller, L. Group graphs and computational symmetry on massively parallel architecture. J Supercomput 5, 99–117 (1991). https://doi.org/10.1007/BF00127839
Issue Date:
DOI: https://doi.org/10.1007/BF00127839