Moby was a conventional searcher, but distributed the search across the available processors in a homogeneous fashion, that is all processors are carrying out the same type of operations, rather than some processors doing deep scout searches while others do more complete searches guided by the information returned by the scouts. Load balancing is archived by processor overloading - each processor supports a hash table manager responsible for part of the global transposition table. One distinguished processor acts as system master, interacting with the user and handling file i/o when the opening books are consulted.
a multiprocessor chess program participating at the WCCC 1989, running on a large (200 to 400 processor) Meiko Computing Surface based on Inmos T800 Transputer chips, installed at University of Edinburgh as part of the Edinburgh Concurrent Supercomputer Project. Moby was a descendant of Cyrus 68K, whose development begun by Mark Taylor and David Levy in 1985, the parallel implementation was done by Greg Wilson.
Table of Contents
Authors
Description
based on WCCC 1989 booklet [2]See also
External Links
Chess Program
Misc
References
What links here?
Up one Level