Find scheme for processes.

- Round-table algorithm:
- Pass letter with proposed time
*t*.*F*sets time to*f(t)*and passes letter. After one round without change, algorithm terminates.

- Pass letter with proposed time
- Central coordinator:
- Coordinator broadcasts maximum
*t*,*F*sends*f(t)*back. When coordinator receives identical values, algorithm terminates.

- Coordinator broadcasts maximum
- Divide and conquer:
- Divide persons into two groups, find meeting points for each group. When times differ, maximum time used for repeating steps.

- Bidding scheme:
- Auctioneer calls out time
*t*;*F*can raise bid to*f(t)*. Algorithm terminates, when bid value cannot be raised any more.

- Auctioneer calls out time

Wolfgang.Schreiner@risc.uni-linz.ac.at

Id: intro.tex,v 1.2 1996/01/31 15:37:03 schreine Exp schreine