/TwinPrimes

Twin Prime concurrency project

Primary LanguageC++Creative Commons Zero v1.0 UniversalCC0-1.0

PrimePairs Using OpenMP



Student Josh Hudziak
Student number: C00231846


Tutor: Joseph Keoghe
Requirments: Git, Emacs, g++, gdb, Make, Doxygen, OpenMp


Dependencies

Linux, G++, gdp debuging, OpenMP and make (makefile), doxygen

Installation

Installation can be done in the CLI running Makefile -k And Run by using ./primes_seq in the CLI. */
Finding Prime Pairs
Using C++ and OpenMP, write a parallel program that counts the number of primes less than n for any number n and also find and list all the twin primes (5,7), (11,13) less than n. The main objective is to use parallel programming to produce efficient code using multiple threads. The finished program is timed and rated while using different amounts of threads. The Max threads for my machine is 6. primes_seq is the baseline without any OpenMp