1. S. G. Abraham and D. E. Hudak. Compile-time partitioning of iterative parallel loops to reduce cache cache coherency.IEEE Tr. Par Distr. Syst., 2(3): 318–328, july 1991.
2. S. B. Baden. Programming abstractions for dynamically partitioning and coordinating localized scientific calculations running on multiprocessors.—In data management [3],. pages 145–157.
3. M. J. Berger and S. H. Bokhari. A partitioning strategy for nonuniform problems on multiprocessors.IEEE Trans. Comp., 36(5): 570–580, May 1987.
4. R. Bixby, K. Kennedy, and U. Kremer. Automatic data layout using 0–1 integer programming. In M. Cosnard, G. R. Gao, and G. M. Silberman, editors,Proc. Int. Conf. Parallel Architectures and Compilation Techniques, pages 111–123. Elsevier Science b. v. (North Holland), 1994.
5. M. Cannataro, S. Di Gregorio, R. Rongo, W. Spataro, G. Spezzano, and D. Talia. A parallel cellular automata environment on multicomputers for computational science.Parallel Computing, 21: 803–823, 1995.