MPI-SeivingPrimes.pptVIP

Code (3/4) for (i = 0; i size; i++) marked[i] = 0; if (!id) index = 0; prime = 2; do { if (prime * prime low_value) first = prime * prime - low_value; else { if (!(low_value % prime)) first = 0; else first = prime - (low_value % prime); } for (i = first; i size; i += prime) marked[i] = 1; if (!id) { while (marked[++index]); prime = index + 2; } MPI_Bcast (prime, 1, MPI_INT, 0, MPI_COMM_WORLD); } while (prime * prime = n); Code (4/4) count = 0; for (i = 0; i size; i++) if (!mar