DocumentCode
3011757
Title
Group graphs and computational symmetry on massively parallel architecture
Author
Stiller, Lewis
fYear
1990
fDate
12-16 Nov 1990
Firstpage
344
Lastpage
353
Abstract
Group graphs are used to implement and reduce routing time in a domain whose associated operators are invariant under a group of invariances in a massively parallel environment. The algorithms are implemented in a program that solves chess endgames, part of whose space is invariant under a noncommutative crystallographic group
Keywords
computational geometry; games of skill; graph theory; group theory; parallel architectures; chess endgames; computational symmetry; group graphs; invariances; massively parallel architecture; noncommutative crystallographic group; Algorithm design and analysis; Automatic control; Computer architecture; Concurrent computing; Crystallography; Parallel architectures; Processor scheduling; Routing; State-space methods; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Supercomputing '90., Proceedings of
Conference_Location
New York, NY
Print_ISBN
0-8186-2056-0
Type
conf
DOI
10.1109/SUPERC.1990.130040
Filename
130040
Link To Document