Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/B542ED9E-AE92-49F0-94F6-8266DDEFE089 | ||
| Year | 2011 | ||
| Type of Item | Conference Publication | ||
| License |
|
||
| Bibliographic Citation | P. Malakonakis and A. Dollas, "Exploitation of parallel search space evaluation with FPGAs in combinatorial problems: the Eternity II case," in International Conference on Field Programmable Logic and Applications, 2011, pp. 264-268. doi:10.1109/FPL.2011.53 https://doi.org/10.1109/FPL.2011.53 | ||
| Appears in Collections |
The Eternity II puzzle is a combinatorial search problem which qualifies as a computational grand challenge. As no known closed form solution exists, its solution is based on exhaustive search, making it an excellent candidate for FPGA-based architectures, in which complex data structures and non-trivial recursion are implemented in hardware. This paper presents such an architecture, which was designed and fully implemented on a Virtex5 FPGA (XUP ML505 board). Despite the serial nature of the recursion, as parallelism can be applied with the initiation of multiple searches, the system shows a measured speedup of 2.6 vs. a high-end multi-core compute server.
Copyright © DIAS 2013
