int m;
int mk=16;
int nk = (int)(pow(2,mk)),
- nq=10,
+ nq=10,
np, node, no_nodes, i, ik, kk, l, k, nit, no_large_nodes, np_add, k_offset;
int verified;
char size[500]; // mind the size of the string to represent a big number
fprintf(stdout," Number of random numbers generated: %s\n",size);
fprintf(stdout," Number of active processes: %d\n",no_nodes);
}
- verified = FALSE;
/* Compute the number of "batches" of random number pairs generated per processor. Adjust if the number of processors
* does not evenly divide the total number */
for (i=0;i<2*nk;i++) {
x[i] = -1e99;
}
- Mops = log(sqrt(abs(1)));
/* Synchronize before placing time stamp */
MPI_Barrier( MPI_COMM_WORLD );
for (i=1;i<=100 && !stop;i++) {
ik = kk / 2;
if (2 * ik != kk) {
- t3 = randlc(&t1, &t2);
+ randlc(&t1, &t2);
}
if (ik==0)
stop = TRUE;
else {
- t3 = randlc(&t2, &t2);
+ randlc(&t2, &t2);
kk = ik;
}
}