Abstract

As the end of Dennard scaling is almost approaching, a number of bio-inspired algorithms have been gaining attention these days to realize new types of computing models and architectures. AmoebaSAT is one of such algorithms that can efficiently solve satisfiability (SAT) problems and optimization problems that are transformed to SAT. It is regarded as a promising algorithm, especially when its hardware architecture is deployed on the Internet-of-Things (IoT) and embedded systems applications due to its inherent parallelism and excellent solution search performance. The key feature of this algorithm is to leverage fluctuations for efficiently searching a solution. However, no prior works sufficiently explored the suitable architecture structure nor the effective fluctuation parameters to realize the hardware solver. This paper intensively studies multiple architectures to implement the AmoebaSAT hardware solver and the effects of fluctuations, which are realized by pseudo random number generators on a digital device. By exhaustively examining the combinations of fluctuation parameters, we provide insightful findings and discussions on the efficient architecture and parameters from the algorithmic perspectives.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.