Previous     Next     Index GSL Home

Date: Wed, 8 Mar 89 15:32:25 EST
From:: djb@wheaties.ai.mit.edu (David J. Braunegg)
To: all-ai@ai.ai.mit.edu
Subject: Parallel GSL Algorithm

		  EXPERIMENT IN PARALLEL ALGORITHMS

			      12:00 Noon
			   Friday, March 10
			  8th Floor Playroom


To further his research on parallel algorithms, Henry Minksy has
designed the following algorithm for taking attendance at the GSL.
Please help Henry toward graduation by taking part.


Algorithm for counting how many people attend the GSL:

[1] Everyone has a number. Initially that number is 1. 

[2] As you talk to people at lunch, you can either give your number
    away, or take someone else's number. The rules for giving and
    taking numbers are:

    [2a] If you take someone's number, then your new number is the SUM
         of your old number and the other person's number. The other
         person is left with zero.

    [2b] If you give away your number to another person, your new
         number is ZERO.

[3] Your number must be zero before you leave the lunch. That way, the
    last person to leave will get the  total sum.


Hosts:  Mike Caine, Bruce Thompson, Andy Christian, and Kamala Sundaram
Algorithm:  Henry Minsky
Vacation:  Tom Russ