Parallel Processing: A KISS Approach - University of North Dakota

* process. If slave fails to spawn, it is */
/* not used. */
/***********************************************/
void SPAWN_PVM_NODES(void) {
int cc, j, n;
int tid;
// Initialize array to hold node IDs.
for (j = 0; j < jobsPerNode; j++) {
for (n = 0; n < nodesWanted; n++) {
TID[j*nodesWanted+n] = -1;
}
}
// Spawn slave processes.
if (verbose == yes) {
printf("*************************************************\n");
printf("* MESSAGE - Spawning slave processes.
*\n");
printf("*************************************************\n");
}
for (j = 0; j < jobsPerNode; j++) {
for (n = 0; n < nodesWanted; n++) {
cc = pvm_spawn(slavePath, NULL, 1, nodeNames[n], 1, &tid);
if (cc == 1) {
TID[j*nodesWanted+n] = tid;
if (verbose == yes) {
printf("MESSAGE - Slave spawned on node: %s\n",
nodeNames[n]);
}
} else {
if (verbose == yes) {
printf("WARNING - Slave failed on node: %s\n",
nodeNames[n]);
}
}
}
}
}
/***********************************************/
/* SHUT_DOWN_PVM */
/* This routine does the following: */
/* 1. Shuts down PVM. */
/* */
/* !No changes should be made to this routine! */
/* */
/* R. Marsh. July 2006. UND Computer Science. */
/***********************************************/
void SHUT_DOWN_PVM(void) {
if (verbose == yes) {
printf("*************************************************\n");
printf("* MESSAGE - Shutting down PVM deamons.
*\n");
}
printf("*************************************************\n");
}
pvm_halt();
44