search

jlabeit / parallel-divsufsort

Parallel Lightweight Suffix Array Algorithm.
MIT License
16 stars 5 forks source link

Visual C++ build? #1

Open deenz opened 7 years ago

deenz commented 7 years ago

Greetings,

I am interested in using this for a research project for which I build suffix arrays and inverse suffix arrays. I have so far been using the original divsufsort and although it seems to have some openmp capability built in, I don't seem to be able to get different performance turning openmp on and off (i.e. both compiler options give the same performance result).

My project is already built in VC++ and I was wondering if I could use your parallel version of divsufsort to improve my results. Do you have any notes or pointers for building your code in VC++ (2013 and above)? Would it be enough to swap some of the original divsufsort code with your version to get better results?

Sincerely, Faizal

jlabeit commented 7 years ago

Hi Faizal,

unfortunately I have not tried to compile and run the code with visual studios. However, what you can do is you can generate a visual studio project from the CMakeLists.txt file. This should be straight forward. If you run into problems please let me know.

In the CMakeLists.txt you can set what techniques are used for parallelization (OpenMP or CilkPlus). OpenMp should work straight-forward with the Visual Studios compiler. I am achieving better speedups with Cilkplus though You would probably need to use the Parallel Intel Compiler to use Cilkplus with Visual Studios.

Regards,

Julian