Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
ParallelPrimeSearch
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Hailu, Dawit
ParallelPrimeSearch
Commits
c19cfb86
Commit
c19cfb86
authored
3 years ago
by
Hailu, Dawit
Browse files
Options
Downloads
Patches
Plain Diff
Update README.md
parent
3e2536d6
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
README.md
+13
-3
13 additions, 3 deletions
README.md
with
13 additions
and
3 deletions
README.md
+
13
−
3
View file @
c19cfb86
# HelloMP
A modification of the HelloMP parallelization by Prof. J.Behrens.
Yet another Hello World Program
**Finding the primes between 2 and a big number by using parallelization**
## Description and Purpose
This O(1)-line code demonstrates parallelization with OpenMP
OMP_NUM_THREADS represent the number of processors. For this project, I have worked on my personal computer,
with 7 processors, and the university's GPU server with 16 processors(OMP_NUM_THREADS).
## Contents of this Project
```
README - this file
Makefile - Makefile tested for macOS
Hello.c - parallelized "Hello World" C-program
Hello.c - parallelized "Hello World" C-program and an algorithm to check whether a number is prime or not by dividing the range
to the number of processors available.
```
## What do do here
...
...
@@ -36,5 +41,10 @@ I don't know how...
```
%> Hello
```
## Result
For the prime numbers between 2 and 800,000:
2:36 Seconds for seriel only(with out parallelization)
1:16 seconds for 7 processors personall computer
55 seconds for 16 processors(Uni-server)
(c) 2021, Jörn Behrens (joern.behrens@uni-hamburg.de)
(c) 2021, Dawit Hailu (dawit.hailu@uni-hamburg.de)
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment