Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/B542ED9E-AE92-49F0-94F6-8266DDEFE089 | - |
| Identifier | https://doi.org/10.1109/FPL.2011.53 | - |
| Identifier | http://ieeexplore.ieee.org/document/6044826/ | - |
| Language | en | - |
| Extent | 5 pages | en |
| Title | Exploitation of parallel search space evaluation with FPGAs in combinatorial problems: the Eternity II case | en |
| Creator | Malakonakis Pavlos | en |
| Creator | Μαλακωνακης Παυλος | el |
| Creator | Dollas Apostolos | en |
| Creator | Δολλας Αποστολος | el |
| Publisher | Institute of Electrical and Electronics Engineers | en |
| Content Summary | 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. | en |
| Type of Item | Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Publication | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-11-17 | - |
| Date of Publication | 2011 | - |
| Subject | Field programmable logic arrays | en |
| Subject | FPGAs | en |
| Subject | field programmable gate arrays | en |
| Subject | field programmable logic arrays | en |
| Subject | fpgas | en |
| 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 | en |
Copyright © DIAS 2013
