3. Parallel Algorithm

We particularly notice that in the case of sampled databases, the performance of the parallel algorithm is equivalent to JANUS's, which is about $22$ times faster than $C^3$ Simplex in PerfectClub case and $73$ times faster in SPEC95 case. For the filtered databases, the parallel algorithm PA is as fast as JANUS, and about $15$ times faster than $C^3$ Simplex, for PerfectClub benchmark; JANUS is $30$ times faster than $C^3$ Simplex for the SPEC95 benchmark.