The Concurrent Prime Number Test uses the trial 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 threads that 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. This linear speedup is close to the theoretical maximum.

The Concurrent Prime Number Test Model was created using the Easy Java Simulations (EJS) modeling tool. It is distributed as a ready-to-run (compiled) Java archive. Double clicking the model's jar file will run the simulation if Java is installed.

Please note that this resource requires
at least version 1.6 of
Java.

Sequential Prime Number Test Model The Sequential Prime Number Test model uses the prime division algorithm to decide if a number is prime. The model records the computational time in milliseconds required to test each number and total computational time. The model shows that the total computational …
The Sequential Prime Number Test model uses the prime division algorithm to decide if a number is prime. The model records the computational time in milliseconds required to test each number and total computational time. The model shows that the total computational time is approximately equal to the sum of the individual times because the tests are performed sequentially.

Concurrent Prime Number Test Source Code
The source code zip archive contains an XML representation of the Parallel Region Prime Number Computation Model. Unzip this archive in your Ejs workspace to compile and run this model using EJS. download 37kb .zip
Last Modified: October 15, 2013
previous versions

Sequential Prime Number Test Source Code
The source code zip archive contains an XML representation of the Sequential Prime Number Test Model. Unzip this archive in your EJS workspace to compile and run this model using EJS. download 20kb .zip
Last Modified: October 11, 2013

W. Christian, Computer Program CONCURRENT PRIME NUMBER TEST MODEL, Version 1.0 (2012), WWW Document, (http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534).

W. Christian, Computer Program CONCURRENT PRIME NUMBER TEST MODEL, Version 1.0 (2012), <http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534>.

Christian, W. (2012). Concurrent Prime Number Test Model (Version 1.0) [Computer software]. Retrieved May 4, 2016, from http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534

Christian, Wolfgang. "Concurrent Prime Number Test Model." Version 1.0. http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534 (accessed 4 May 2016).

Christian, Wolfgang. Concurrent Prime Number Test Model. Vers. 1.0. Computer software. 2012. Java 1.6. 4 May 2016 <http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534>.

%A Wolfgang Christian %T Concurrent Prime Number Test Model %D January 19, 2012 %U http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534 %O 1.0 %O application/java

%0 Computer Program %A Christian, Wolfgang %D January 19, 2012 %T Concurrent Prime Number Test Model %7 1.0 %8 January 19, 2012 %U http://www.compadre.org/Repository/document/ServeFile.cfm?ID=11669&DocID=2534

Disclaimer: ComPADRE offers citation styles as a guide only. We cannot offer interpretations about citations as this is an automated procedure. Please refer to the style manuals in the Citation Source Information area for clarifications.

The Easy Java Simulations Modeling and Authoring Tool is needed to explore the computational model used in the Parallel Region Prime Number Computation Model.