1 / 7

Accelerating SAT Problem Solutions with DataFlow Machines at University of Belgrade

This research explores the acceleration of the SAT (satisfiability) problem using DataFlow machines, specifically Maxeler technology. The synergy between logic and computer science is leveraged to enhance problem-solving capabilities. This work examines existing solutions and proposes a novel approach combining mapping and optimization techniques. Detailed analysis through mathematical and simulation methods confirms performance improvements. Key applications in VLSI design are highlighted, revealing potential for scalability and efficiency. For further details, visit the full work online.

quemby-warner
Télécharger la présentation

Accelerating SAT Problem Solutions with DataFlow Machines at University of Belgrade

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ZivojinSustran, ETF, University of Belgrade VeljkoMilutinovic, ETF, University of Belgrade ZoranOgnjanovic, Mathematical Institute of the Serbian Academy of Sciences and Arts Acceleration of the SAT Problem

  2. MyWork in a NutShell • Introduction: Synergy of Logics and CS • Problem: Moving SAT to Maxeler • Existing Solutions: Many and none • Essence: Map+Optimize (PACT) • Details: MyPhD • Analysis: Math+Simulation • Conclusion: Expected 10000 (SPC) • Full work on the web: URL=http://home.etf.rs/~vm/os/vlsi/predavanja/maxeler.html

  3. The SATisfiability Problem • Essence of SAT The problem of determining if there exists an interpretation,which satisfies the formula. • Formula for SATF = (x11·x12·x13) +(x21·x22·x23)+(x31·x32·x33)+… • Applications of SAT • VLSI Design

  4. Implementation of SAT • Bad: Limited scalability. • Good: No data interdependencies among loop iterations. • Excellent: The best potentials for acceleration on DataFlow machines.

  5. Kernel(S) Generation of variables permutations Function calculation Results checking

  6. Performance • Run time on MAX 2 and MAX 3 = Z2 and Z3 • Run time on i7 = Z7 • Speedup on MAX 2 and MAX 3 = X2 and X3 • Power reduction: SasaStojanovic is our expert!

  7. Q+A: zika@etf.bg.ac.rs

More Related