From 1644ef59853053009393e60aa2d277dced69c5fe Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Arturo=20Mart=C3=ADn-de-Nicol=C3=A1s?= Date: Thu, 10 Sep 2020 17:18:56 -0500 Subject: [PATCH] Update README.md Fixed typo. --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 8fa096c..4559788 100644 --- a/README.md +++ b/README.md @@ -3,7 +3,7 @@ - Calculating primes is one of the most computationally intensive task, and an important component in computer security. - This repo aims at calculating prime numbers, in a certain range, using multithreading concepts in NodeJS. - Basic sieve method is used to collect prime numbers. The range is divided between worker-threads here. -- And the number of worker threads spawned is equal to the number of cores, to maximise output. If more spawned need to switch between threads, which takes time, if more spawned, cores underutilized. +- And the number of worker threads spawned is equal to the number of cores, to maximise output. If more spawned need to switch between threads, which takes time, if less spawned, cores underutilized. ## Worker Threads - Javascript can handle I/O events easily, owing to EventLoop. Hence, Node can handle multiple HTTP requests pretty seamlessly.