Matching architecture to application via configurable processors: A case study with Boolean satisfiability problem

Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

Volumn , Issue , 2001, Pages 447-452

  Zhao, Ying ^a   Malik, Sharad ^a   Wang, Albert ^b   Moskewicz, Matthew W ^c   Madigan, Conor F ^d  

^a Princeton University   (United States)

^b Tensilica Inc   (United States)

^c University of Culifornici ut Berkeley   (United States)

^d USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; DATA STRUCTURES; MULTIPROCESSING SYSTEMS;

BOOLEAN SATISFIABILITY (SAT);

PROGRAM PROCESSORS;

EID: 0035188355     PISSN: 10636404     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCD.2001.955064     Document Type: Article

References (11)

1. Combinational test generation using satisfiability
2. Optimal layout via boolean satisfiability
3. A computing procedure for quantification theory
4. GRASP-A new search algorithm for satisfiability
5. SATO: An efficient propositional prover
6. Engineering a highly efficient SAT solver
7. Satisfiability on reconfigurable hardware
8. Solving boolean satisfiabiligy with dynamic hardware configuration
9. Accelerating boolean satisfiability through application-specific processing