Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial
Work Distribution by Chunking
Finding the Sum of the First n Integers with Chunking
The following is the tuple space “sum of n integers” master program implemented by
sending work in chunks:
#include
#include
#define N 32
main(){
int P;
// Number of processors
int chunk_size;
// Chunk size
int remainder;
// Remainder of numbers to be sent
int i;
// Counter index
int job;
// Job number
int status;
// Return status for tuple operations
int res;
// Result tuple space identifier
int tsd;
// Problem tuple space identifier
int *sendArr = 0;
// Number sent to problem ts
int sendNum;
// Number sent to worker in sendArr
int recdSum = 0;
// Subsum recieved from result ts
int *recdPtr = &recdSum; // Pointer to recdSum
int calcSum = 0;
// Calculated sum
int sumTotal = 0;
// Sum total of all subsums
int tplength;
// Length of ts entry
char tpname[20];
// Identifier of ts entry
char host[128];
// Host machine name
// Get host machine name
gethostname(host, sizeof(host));
// Open tuple spaces
printf("Master: Opening tuple spaces\n");
// Open problem tuple space
tsd = cnf_open("problem", 0);
// Open result tuple space
res = cnf_open("result", 0);
printf("Master: Tuple spaces open complete\n");
// Get number of processors
P = cnf_getP();
printf("Master: Processors %d\n", P);
// Get chunk size
chunk_size = cnf_getf();
printf("Master: Chunk size %d\n", chunk_size);
// Put chunk size in ts
// Set length of entry
166