We present some parallelization techniques for the Model Evolution (ME) calculus, an instantiation-based calculus that lifts the DPLL procedure to first-order clause logic. Specifically, we consider a restriction of ME to the EPR fragment of clause logic for which the calculus is a decision procedure. The main operations in ME’s proof procedures, namely clause instantiation and candidate litera...

In this paper we present the parallelization process of the AES algorithm (Rijndael) along with the description of exploited parallelization tools. The data dependences analysis of loops and appropriate loop transformations were applied in order to parallelize the sequential algorithm. The OpenMP standard was chosen for representing the parallelism of the AES algorithm. Speed-up measurements fo...

DICE is a general purpose multidimensional numerical integration package. There can be two ways in the parallelization of DICE, “distributing random numbers into workers” and “distributing hypercubes into workers”. Furthermore, there can be the combination of both ways. So far, we had developed the parallelization code using the former way and reported it in ACAT2002 in Moscow. Here, we will pr...

The shift of the microprocessor industry towards multicore architectures has placed a huge burden on the programmers by requiring explicit parallelization for performance. Implicit Parallelization is an alternative that could ease the burden on programmers by parallelizing applications “under the covers” while maintaining sequential semantics externally. This thesis develops a novel approach fo...

Different parallelization methods vary in their system requirements, programming styles, efficiency of exploring parallelism, and the application characteristics they can handle. For different situations, they can exhibit totally different performance gains. This paper compares OpenMP, MPI, and Strings for parallelizing a complicated tribology problem. The problem size and computing infrastruct...