25,161
edits
Changes
no edit summary
=Publications=
* [[Chrilly Donninger]], [[Ulf Lorenz]] ('''2004'''). ''[http://www.springerlink.com/content/hp9la9pwq0a1cmrp/ The Chess Monster Hydra]''. in [http://www.springerlink.com/content/8grv6pu2e8hd/?p=3037c8af6a0147319f6f5a8e133083dd&pi=0 Field Programmable Logic and Application], 14th International Conference, FPL 2004, Leuven, Belgium, August 30-September 1, 2004[https://en. Proceedings, pp 927-932wikipedia. org/wiki/Springer_Science%2BBusiness_Media Springer Berlin / Heidelberg, ISBN 978-3-540-22989-6], [http://www2.cswww.unitop-paderborn5000.de/cs/ag-monien/PERSONAL/FLULOnl/publicationsps/fpl04The%20chess%20monster%20Hydra.pdf pdf]
: Abstract
: With the help of the FPGA technology, the boarder between hard- and software has vanished. It is now possible to develop complex designs and fine grained parallel applications without the long-lasting chip design cycles. Additionally, it has become easier to write coarse grained parallel applications with the help of message passing libraries like MPI. The chess program Hydra is a high level hardware-software co-design application which profits from both worlds. We describe the design philosophy, general architecture and performance of Hydra. The time critical part of the search tree, near the leaves, is explored with the help of fine grain parallelism of FPGA cards. For nodes near the root, the search algorithm runs distributed on a cluster of conventional processors. A nice detail is that the FPGA cards allow the implementation of sophisticated chess knowledge without decreasing the computational speed.
