Describe the 4 basic Linda operations. Uses information hiding Treated as collection of separate objects instead of linear address space. If no tuple matches template, calling process waits until match is inserted. Each constant or variable in the template matches its tuple field. When procedure completes it becomes an inactive tuple.
Main process puts out task tuples to be performed.
Workers retrieve task tuples and perform tasks. Linda Implementation Hashtable in global memory. Divide all space into disjoint subspaces and tuple goes into appropriate subspace. Perfect for job jar allocation schemes. Cache is faster than memory.