These values are displayed on an openly-visible sheet of paper in such a way that all processors can readily see whatever cells they need to. Memory constructs the new iteration's activity matrix as new information is provided, and displays it when all cells have been filled in. One person is designated as network , the rest are processors . One processor is identified as boss , all others are workers . The cells are given initial random values, as above.
Network passes the request along to boss .
Network delivers these messages to boss . You can basically follow all of the above steps, keeping separate timings as you play each separate role. This is not to say that it can't be done, just that the bookkeeping can get quite complex. Conclusions As can certainly be intuited from the number and complexity of the instructions, the shared-memory model would appear to be conceptually the simpler of the two, and the easier to implement. This greatly reduces the decision-space when it comes time to add new elements.