In [1]:

    

## example 1 - it calculates the sum of primes under a certain integer
import sys, time, math
import pp


    

In [6]:

    

def is_prime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    for i in xrange(2, int(math.sqrt(n)+1)+1):
        if n % i == 0:
            return False
    return True


    

In [18]:

    

def sum_primes(n):
    return sum([n for n in xrange(2, n) if is_prime(n)])
%timeit sum_primes(1000000)


    

    




1 loops, best of 3: 6.52 s per loop

In [14]:

    

## tuple of all parallel python servers to connect with
ppservers = ()
job_server = pp.Server(ppservers=ppservers)
print 'starting pp with', job_server.get_ncpus(), 'workers'


    

    




starting pp with 4 workers

In [20]:

    

job1 = job_server.submit(sum_primes, (1000000,), (is_prime,), ('math',))


    

In [21]:

    

%timeit result = job1()


    

    




1 loops, best of 3: 954 ns per loop

In [24]:

    

print job1()
print sum_primes(1000000)


    

    




37550402023
37550402023

In [ ]: