Andrew Sohn  Home/Search
Context
Related
| njit.edu/sohn/papers/jpdcsat.ps.gz njit.edu/~sohn/papers/jpdcsat.ps.gz njit.edu/~sohn/papers/jpdcsat.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: njit.edu/sohn/papers/index (more) From: njit.edu/~sohn/papers/index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Solving the hard Satisfiability Problem is time consuming even for modest-sized problem instances. Solving the Random L-SAT Problem is especially difficult due to the ratio of clauses to variables. This report presents a practical approach to solving the Random L-SAT Problem on a large-scale distributed-memory multiprocessor. In particular, we use a parallel synchronous simulated annealing procedure, called Generalized Speculative Computation, which guarantees the same decision sequence as... (Update)
Similar documents based on text: More All
0.3: S-HARP: A Scalable Parallel Dynamic Partitioner for Adaptive.. - Sohn, Simon (1998) (Correct)
0.3: A BDD-Based Satisfiability Infrastructure using the.. - Kalla, Zeng.. (2000) (Correct)
0.3: Data and Workload Distribution in a Multithreaded.. - Sohn, Sato, Yoo, Gaudiot (1996) (Correct)
BibTeX entry: (Update)
@article{ sohn96parallel,
author = "Andrew Sohn",
title = "Parallel Satisfiability Test with Synchronous Simulated Annealing on Distributed-Memory Multiprocessor",
journal = "Journal of Parallel and Distributed Computing",
volume = "36",
number = "2",
pages = "195--204",
year = "1996",
url = "citeseer.ist.psu.edu/sohn96parallel.html" }
Citations (may not include all citations):1527 Optimization by Simulated Annealing - Kirkpatrick, Gelatt et al. - 1983
643 Equations of State Calculations by Fast Computing Machines (context) - Metropolis, Rosenbluth et al. - 1953
459 A Computing Procedure for Quantification Theory (context) - Davis, Putnam - 1960
320 Hard and Easy Distributions of SAT Problems - Mitchell, Selman et al. - 1992
81 Critical Behavior in the Satisfiability of Random Boolean Ex.. - Kirkpatrick, Selman - 1994
74 An Empirical Study of Greedy Local Search for Satisfiability.. - Selman, Kautz - 1993
65 Probabilistic Analysis of the Davis-Putnam Procedure for Sol.. (context) - Franco, Paull - 1983
63 Algorithms for the Maximum Satisfiability Problem (context) - Hansen, Jaumard - 1990
40 Parallel Simulated Annealing Techniques (context) - Greening - 1990
27 Placement by Simulated Annealing on a Multiprocessor (context) - Kravitz, Rutenbar - 1987
24 Simulated Annealing for Hard Satisfiability Problem - Spears - 1993
21 Parallel Simulated Annealing Algorithms for Cell Placement o.. (context) - Banerjee, Jones et al. - 1990
12 Parallel Simulated Annealing Using Speculative Computation (context) - Witte, Chamberlain et al. - 1991
11 Low-Latency Message Communication Support for the AP1000 (context) - Shimizu, Ishihata et al. - 1992
4 Improving AP1000 Parallel Computer Performance with Message .. (context) - Horie, Hayashi et al. - 1993
3 Parallel N-ary Speculative Computation of Simulated Annealin.. (context) - Sohn - 1995
1 Satisfiability and Maximum Satisfiability Descriptions, Read.. (context) - Implementation - 1992
1 A Parallel Simulated Annealing Algorithm for the 14 Placemen.. (context) - Casotto, Romeo et al. - 1987
Documents on the same site (http://www.cis.njit.edu/sohn/papers/index.html): More
N-ary Speculative Computation of Simulated Annealing on the.. - Andrew Sohn (Correct)
Data and Workload Distribution in a Multithreaded.. - Sohn, Sato, Yoo, Gaudiot (1996) (Correct)
Identifying the Capability of Overlapping.. - Sohn, Ku, Kodama, .. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC