- How to Program, Part I
- How to Program, Part II
- How to Program, Part III
- How to Program, Part IV
- How to Program, Part V
- exercises
- pyMPI tutorial
- Calculating PI, Part I
- Calculating PI, Part II
- Calculating PI, Part III
- Poogle - Web Search
- Mandelbrot Sets
- Mandelbrot, The Code
- Mandelbrot, The Images
- Conway's Life, Part I
- Life Code Listing
- Conway's Life, Part II
- MPI Life Code Listing
| Life Code Listing
| file: lifem0.py |
| 1 | # Eliminate the mpi.barrier() call and use tags. |
| 2 | import time |
| 3 | import sys |
| 4 | |
| 5 | # define the board, so far so good.... |
| 6 | board = [ |
| 7 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0], |
| 8 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0], |
| 9 | [0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1], |
| 10 | [0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1], |
| 11 | [1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 12 | [1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0], |
| 13 | [0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0], |
| 14 | [0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 15 | [0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 16 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 17 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 18 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 19 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 20 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 21 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 22 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 23 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 24 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 25 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 26 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 27 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 28 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 29 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 30 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 31 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 32 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 33 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 34 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 35 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 36 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 37 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 38 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 39 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 40 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 41 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], |
| 42 | [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]] |
| 43 | |
| 44 | # rows of the board given to an mpi proc |
| 45 | ilo = 0 |
| 46 | ihi = len(board)-1 |
| 47 | |
| 48 | # print one row of the board |
| 49 | def prow(row): |
| 50 | str = "" |
| 51 | for e in row: |
| 52 | if e == 0: |
| 53 | str += ". "; |
| 54 | else: |
| 55 | str += "X "; |
| 56 | print str |
| 57 | |
| 58 | # print out the board.... |
| 59 | def pboard(board): |
| 60 | # magic to clear the screen and home the cursor |
| 61 | print "\033[H\033[2J", |
| 62 | print "Printing Board:" |
| 63 | for row in board: |
| 64 | prow(row) |
| 65 | print |
| 66 | |
| 67 | pboard(board) |
| 68 | |
| 69 | # number of game steps to play |
| 70 | nsteps = 1000 |
| 71 | |
| 72 | # start playing |
| 73 | for step in range(nsteps): |
| 74 | |
| 75 | # create a new board with all zeros |
| 76 | nboard = [] |
| 77 | for k in range(len(board)): |
| 78 | nrow = [] |
| 79 | for j in range(len(board[k])): |
| 80 | nrow.append(0) |
| 81 | nboard.append(nrow) |
| 82 | |
| 83 | # iterate over the old board |
| 84 | for i in range(ilo,ihi+1): |
| 85 | for j in range(len(board[i])): |
| 86 | |
| 87 | # find nearest neighbors... |
| 88 | sum = 0 |
| 89 | for deli in range(-1,2): |
| 90 | for delj in range(-1,2): |
| 91 | if delj == 0 and deli == 0: |
| 92 | pass |
| 93 | elif i+deli < 0 or j+delj < 0: |
| 94 | pass |
| 95 | elif i+deli >= len(board) or j+delj >= len(board[i]): |
| 96 | pass |
| 97 | else: |
| 98 | sum = sum + board[i+deli][j+delj] |
| 99 | |
| 100 | # rule to stay alive |
| 101 | if board[i][j]==1 and sum == 2 or sum == 3: |
| 102 | nboard[i][j] = 1 |
| 103 | |
| 104 | # rule for birth |
| 105 | elif board[i][j]==0 and sum == 3: |
| 106 | nboard[i][j] = 1 |
| 107 | |
| 108 | # stay empty / die |
| 109 | else: |
| 110 | nboard[i][j] = 0 |
| 111 | |
| 112 | # trade the old board for the new one |
| 113 | board = nboard |
| 114 | |
| 115 | # print out the current step (debug) |
| 116 | if step < 100: |
| 117 | pboard(board) |
| 118 | |
| 119 | # print result |
| 120 | pboard(board) |
| |
| |