Skip to content

Latest commit

 

History

History
36 lines (19 loc) · 1.15 KB

README.md

File metadata and controls

36 lines (19 loc) · 1.15 KB

parallel_convex_hull

Parallel implementation of divide et impera algorithm for convex hull

Note: unfortunately there are some weird formatting problems (tabs) in some sections of the code on GitHub probably due to the fact that some sections of the code were developed directly on the High-Performance Computing cluster @ UniTrento

Benchmark spreadsheet

Benchmark spreadsheet

How to run the code

General steps:

  • cd parallel_convex_hull (Moving inside the directory)
  • module load mpich-3.2 (Loading the MPICH module)
  • make clean (Cleaning older binaries and output files)

For the serial program:

  • make serial (Compiling the serial program)
  • make sub_serial (Submitting the job)

For the parallel program:

  • make parallel (Compiling the parallel program)
  • make sub_parallel (Submitting the job)
  • make sub_benchmark (Submitting 10 jobs in a row)