Description
Prime Number Computation is a simple application that uses the prime division algorithm to decide if a number is prime.
The prime division algorithm is inefficient and we use it here only to test the EJS implementation of the Parallel Region Element in EJS. A
parallel region executes independent code in a separate thread and these threads can execute simultaneously on a multi-core processor.
The screen capture shows that the total execution time for four computations on a quad-core processor is only one millisecond longer than the execution time for the longest single computation.
User Reviews for Prime Number Computation FOR MAC 1
-
Prime Number Computation FOR MAC is a great tool for testing the EJS implementation of the Parallel Region Element. Efficient and useful.