Satisfiability test with synchronous simulated annealing on the Fujitsu AP1000 massively-parallel multiprocessor | Zendy

Andrew Sohn | Zendy; Rupak Biswas | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Satisfiability test with synchronous simulated annealing on the Fujitsu AP1000 massively-parallel multiprocessor

Author(s) -

Andrew Sohn,

Rupak Biswas

Publication year - 1996

Publication title -

nasa sti repository (national aeronautics and space administration)

Language(s) - English

Resource type - Conference proceedings

ISBN - 0-89791-803-7

DOI - 10.1145/237578.237606

Subject(s) - multiprocessing , computer science , citation , massively parallel , research center , test (biology) , simulated annealing , operating system , parallel computing , library science , algorithm , medicine , paleontology , pathology , biology

Solving the hard Satisfiability Problem is time consumingeven for modest-sized problem instances. Solving the RandomL-SAT Problem is especially difficult due to the ratioof clauses to variables. This report presents a parallel synchronoussimulated annealing method for solving the RandomL-SAT Problem on a large-scale distributed-memorymultiprocessor. In particular, we use a parallel synchronoussimulated annealing procedure, called Generalized SpeculativeComputation, which guarantees the...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research