loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware
Napa California
April 21-April 23
ISBN: 0-7695-0375-6
Miron Abramovici, Bell Labs - Lucent Technologies
Jose T. de Sousa, Bell Labs - Lucent Technologies
Satisfiability (SAT) is a computationally expensive algorithm central to computer science. In this paper, we present a virtual logic algorithm that allows an FPGA based reconfigurable computing platform to process SAT solver circuits much larger than its available capacity. Our algorithm is based on decomposition techniques that create independent sub-problems (pages) that fit the size of the available reconfigurable hardware. Those pages can take turns reusing the platform, and creating a virtual logic environment.
Citation:
Miron Abramovici, Jose T. de Sousa, "A Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware," fccm, pp.306, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 1999
Usage of this product signifies your acceptance of the Terms of Use.