Basic Gridify Prime Numbers example.

This example demonstrates how prime number check it can be grid-enabled using GridGain and Gridify ^Javadoc annotation. GridGain will detect that a method is annotated with this annotation, it will execute this method on remote node.

Basically it takes all possible number divisors (from 2 up to the number itself but can be optimized of course) and splits them among available nodes on the Grid. Then every node checks whether given number can be divided by at least one of the divisors and if so returns back found divisor.
If all nodes that tested their own divisors set return nothing then this number is a prime one. If at least one node returns divisor then this number is not prime.

Example makes a call of checkPrime(...) method of GridPrimeChecker.java class. Since this method is annotated with Gridify ^Javadoc annotation it is automatically grid-enabled and will be executed on remote node. Note, that the only thing user had to do is annotate method checkPrime(long, long, long) with Gridify ^Javadoc annotation, everything else is taken care of by the system automatically.

You can find this example at ${GRIDGAIN_HOME}/examples/src folder in package org.gridgain.examples.primenumbers.gridify. Source code is fully Javadoc-ed and you can find the examples' Javadoc at ${GRIDGAIN_HOME}/examples/javadoc folder.

Package:
org.gridgain.examples.primenumbers.gridify

Package:
org.gridgain.examples.primenumbers

GridPrimeChecker.java

Simple prime checker. The implementation of this class iterates through the passed in list of divisors and checks if the value is divisible by any of these divisors. Note that this class checkPrime(long, long, long) method has Gridify Javadoc annotation on it and we specify in the annotation that GridifyPrimeTask should be used for grid-enabled execution.