From c19cfb86ca7f32d38f165d59c10b1864945bfa73 Mon Sep 17 00:00:00 2001
From: "Hailu, Dawit Abiy" <dawit.hailu@uni-hamburg.de>
Date: Thu, 8 Jul 2021 11:50:20 +0000
Subject: [PATCH] Update README.md

---
 README.md | 16 +++++++++++++---
 1 file changed, 13 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 2b884c9..80dcd19 100644
--- a/README.md
+++ b/README.md
@@ -1,17 +1,22 @@
 # 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)
-- 
GitLab