Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial
Optimized Programs
Optimized Matrix Multiplication with Chunking
The following is the tuple space “optimized matrix multiplication” master program
implemented by sending work in chunks:
#include
#include
#include
// The A matrix to break up into arrays
// and send to workers
double A[N][N];
double B[N][N];
double C[N][N];
#include "matrix.h"
// Main function
main(){
int processors; // Number of processors
int chunk_size; // Chunk size
int remaining; // Remaining arrays of work
int i, j;
// Matrix indices
int matrix_row; // Index of matrix row
int array_pos; // Array position in rows array
int status;
// Return status for tuple operations
int res;
// Result tuple space identifier
int tsd;
// Problem tuple space identifier
double *rows; // Rows from A to send to worker
double worker_time; // Sum of times returned by workers
double total_time; // Total application run time
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));
// Get time stamp
total_time = wall_clock();
// 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");
185