A Foundation for Advanced Compile-time Analysis of Linda Programs

Efficient implementations of Linda must address two potentially expensive properties of tuple space: associative access and uncoupled communications. Current compile-time analyses have significantly reduced the cost of associative access to tuple space. We propose a set of new analyses that help tackle uncoupling, as well as establish a more general framework for optimizations. We relate these analyses to new optimization strategies and give example applications of the latter.