previous_group previous up next next_group
Previous: 1. Parallel Algorithm: Up: 3. Results for Satisfiability Next: 1. Parallel Algorithm:


3. JANUS 64-bit versus $C^3$ Double Description Method 64-bit

Performance comparison between JANUS 64-bit and Double Description Method 64-bit is illustrated in 6_fig:PerfectClub_satisfiability_dimension_JV64_FDD64_100 and 6_fig:PerfectClub_satisfiability_dimension_JV64_FDD64_filter. They represent the experimental results of PerfectClub sampled and filtered databases.

We remark a very poor performance of FDD64-bit compared to JANUS 64-bit: from $404$ to $520$ times slower. Exceptionally in SPEC95 sampled database results, JANUS 64-bit outruns FDD 64-bit with a very large ratio of $5485$. Therefore, we conclude that in the satisfiability test, it is much faster avoiding the dual conversion using the Chernikova algorithm. This conclusion is important since only $C^3$ implements other methods than the Chernikova algorithm. However, as we will see later in the next section, we need the Chernikova algorithm in some cases.

Figure 19: PerfectClub: Dimension JANUS 64-bit vs $C^3$ FDD 64-bit in sampled database
\begin{figure}
\centering\epsfig {file=POLYBENCH_evaluations/PerfectClub_JV64_FD...
...DATABASE_100/dimension_JV64_FDD64_crite.eps,height=5.9cm,width=14cm}\end{figure}

Figure 20: PerfectClub: Dimension JANUS 64-bit vs $C^3$ FDD 64-bit in filtered database
\begin{figure}
\centering\epsfig {file=POLYBENCH_evaluations_bias/PerfectClub_JV...
...003_Database/dimension_JV64_FDD64_crite.eps,height=5.9cm,width=14cm}\end{figure}

The experimental results for SPEC95 are similar to those obtained with PerfectClub, thus they are not displayed here.



Subsections
previous_group previous up next next_group
Previous: 1. Parallel Algorithm: Up: 3. Results for Satisfiability Next: 1. Parallel Algorithm:
Nguyen Que Duong
2006-09-16