🚀 go-pugleaf

I'd just like to note (as is noted in Cap's paper) that the
performance data for "Linda" given in the <Parform> paper are actually
data for POSYBL (a public domain version of Linda).

As a result, these times almost certainly do not reflect the
performance achievable with optimized implementations of Linda like those
developed by Yale and SCA.

	Also in the paper:

"The bottleneck of LINDA in a distributed environment
is the concept of tuple space, especially the necessary
scanning operations to find tuples of certain format".

	Much of the Linda tuple matching is done at compile
time (see Nick Carriero's Thesis, Yale University).  "Scanning"
is not necessary.  In addition, modern network Linda systems
distribute tuple space eliminating the bottleneck.

David