Download Presentation
Poster

Loading in 2 Seconds...

1 / 7

# Poster - PowerPoint PPT Presentation

Smart FPGA Based SAT Solver. Saleem Sabbagh & Najeeb Darawshy Supervisors: Mony Orbach, Technion & Ilia Averbouch, IBM. Poster. Started at: Spring 2012 Duration: Semester. Abstract.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

## PowerPoint Slideshow about 'Poster' - scot

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Smart FPGA Based SAT Solver

Saleem Sabbagh & Najeeb Darawshy

Supervisors: Mony Orbach, Technion &

Ilia Averbouch, IBM

### Poster

Started at: Spring 2012

Duration: Semester

Abstract

After the conclusion of our previous project, in which we have developed a platform to implement SAT instances onto an FPGA device, along with a random SAT solver, we embarked on building a smarter platform that enables us to significantly cut down compilation times and more importantly to reduce the time it takes to find the satisfying assignment of a given SAT (runtimes). the schemes we have implemented to meet our goals were:

• Building a sophisticated SAT solver GSAT
• Implementing an application specific SAT solver using the memory of the FPGA device.
What is sat
• Boolean Satisfiability Problem
• Given a Boolean propositional formula, does there exist assignment of values such that the formula becomes true?
• e.g., given the formula

f=(x1 ˅ x3˅ -x4) ˄ (x4) ˄ (x2 ˅ -x3)

are there values of x1,x2,x3,x4 that produce f=‘1’

• Satisfiabilitysolvers are increasingly leaving their mark as a general-purpose tool in areas as diverse as software and hardware verification, automatic test pattern generation, planning, scheduling, and even challenging problems from algebra by solving SAT instances made by transforming problems that arise in those areas.
Specification
• Software:
• We have developed a SAT Parser which will convert the input SAT instance from a known DIMACS format to a memory initialization file MIF format.
• Altera Quartus II for connecting to the board via JTAG.
• Hardware:
• Altera DE2 Board with Altera Cyclone® II 2C35 FPGA device for implementing SAT instance and running GSAT SAT solver.
Flow diagram

Reset

Convert

PC

In System

Memory

Content Editor

SignalTap

DE2

Controller

attempts == allowed

• Init
• Reset circuit
• Random Assignment
• Clauses Init
• Var by var run and save to shiftreg
• Flipping
• Flip variable value
• Sum satisfied clauses
• Advance var

var == total vars

var == total vars

• Finish
• Output satisfying assignment
• Maximum
• Increase attempts if max <= 0
• Flip max var and save to shiftreg

satisfied == total clauses

attempts == allowed