Parallel Processing: A KISS Approach - University of North Dakota

***********************************************/
void UPDATE_M(void) {
int i, j;
for (j = 1; j < (Height-1); j++) {
for (i = 1; i < (Width-1); i++) {
M[j][i] = Mprime[j][i];
}
}
}
/***********************************************/
/* The SUM_M routine calculates the sum of the */
/* data. */
/* */
/* I would expect the user would want to */
/* modify this code to fit their application. */
/***********************************************/
double SUM_M(void) {
int i, j;
double sum;
sum = 0.0;
for (j = 1; j < (Height-1); j++) {
for (i = 1; i < (Width-1); i++) {
sum += M[j][i];
}
}
return sum;
}
/***********************************************************/
/* GENERATION ROUTINES */
/***********************************************************/
/***********************************************/
/* LOAD_BALANCE */
/* This routine does the following: */
/* 1. Call functions to inialize the data. */
/* 2. Call the function to process each */
/* iteration of the data. */
/* */
/* I would expect the user would want to */
/* modify this code to fit their application. */
/***********************************************/
void LOAD_BALANCE(void) {
// Define required parameters.
int i, j;
int startTime, stopTime;
int iteration;
double newSum, oldSum;
double convergence;
/***********************************************/
/* Define user specific parameters. */
/* */
/* It is expected that the user will replace */
28