ger is called a perfect number if it is equal to the sum of all positi divisors, excluding itself. For example, 6 is the first perfect number because (The same applies for 28 1+2 + 4+7+14). Write a program that creates an array of N integers (N3000) and fills numbers between 1 and 200. The program has to count the number of perfe array. To do that in less time, it breaks down the job between three thre 1. threadLow: counts perfect numbers in the first part of the array. Sitive this 1000) 2. threadMiddle: counts perfect numbers in the second part of the array up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (Frc 3000)

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Problem 2 - Computing prefect numbers
A positive integer is called a perfect number if it is equal to the sum of all of its positive
divisors, excluding itself. For example, 6 is the first perfect number because 6 = 3 +2 + 1.
(The same applies for 28 1+2 + 4+7+14).
Write a program that creates an array of N integers (N = 3000) and fills it with random
numbers between 1 and 200. The program has to count the number of perfect numbers in
this array. To do that in less time, it breaks down the job between three threads:
1. threadLow: counts perfect numbers in the first part of the array. (From 0 up to
1000)
2. threadMiddle: counts perfect numbers in the second part of the array. (From 1000
up to 2000)
3. threadHigh: counts perfect numbers in the third part of the array. (From 2000 up to
3000)
The parent (main) thread waits for them to finish, calculates the sum of the three values,
and prints it. Note that the three threads have similar jobs to perform with some
differences regarding the range of search in the array.
Transcribed Image Text:Problem 2 - Computing prefect numbers A positive integer is called a perfect number if it is equal to the sum of all of its positive divisors, excluding itself. For example, 6 is the first perfect number because 6 = 3 +2 + 1. (The same applies for 28 1+2 + 4+7+14). Write a program that creates an array of N integers (N = 3000) and fills it with random numbers between 1 and 200. The program has to count the number of perfect numbers in this array. To do that in less time, it breaks down the job between three threads: 1. threadLow: counts perfect numbers in the first part of the array. (From 0 up to 1000) 2. threadMiddle: counts perfect numbers in the second part of the array. (From 1000 up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (From 2000 up to 3000) The parent (main) thread waits for them to finish, calculates the sum of the three values, and prints it. Note that the three threads have similar jobs to perform with some differences regarding the range of search in the array.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education