keky

Matrix decomposition

Mar 22nd, 2015
220
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.02 KB | None | 0 0
  1. void GameOfLife::doa(int row, int col){
  2.     int neighbours = getNeighbourSum(row, col);
  3.     if (buffer[row * width + col] == 1) {
  4.         if ((neighbours == 2) || (neighbours == 3)) {
  5.             nextIter[row * width + col] = 1;
  6.         } else {
  7.             nextIter[row * width + col] = 0;
  8.         }
  9.     } else {
  10.         if (neighbours == 3) {
  11.             nextIter[row * width + col] = 1;
  12.         } else {
  13.             nextIter[row * width + col] = 0;
  14.         }
  15.     }
  16. }
  17.  
  18. void GameOfLife::split_matrix(int row, int col, int range){
  19.     range = range / 2;
  20.     if (0==range){
  21.         doa(row, col);
  22.         return;
  23.     } else{
  24.     // lower right
  25.     cilk_spawn split_matrix(row, col, range);
  26.     // lower left
  27.     cilk_spawn split_matrix(row, col-range, range);
  28.    
  29.     // upper right
  30.     cilk_spawn split_matrix(row-range, col, range);
  31.     // upper left
  32.     split_matrix(row-range, col-range, range);
  33.    
  34.     cilk_sync;
  35.     }
  36.  
  37. }
  38. void GameOfLife::nextIterParallel(){
  39.     // split matrix into four parts
  40.     split_matrix(height-1, width-1, width+1);
  41.  
  42.     // switch buffers
  43.     unsigned char * temp = buffer;
  44.     buffer = nextIter;
  45.     nextIter = temp;
  46.    
  47. }
Advertisement
Add Comment
Please, Sign In to add comment