1. S.G. Akl, Parallel Computation, Prentice Hall, 1997.
2. R.J. Anderson, and L. Snyder, “A Comparison of Shared and Nonshared Memory Models of Computation,” in Proc. of the IEEE, 79(4), pp. 480–487.
3. A. Bäumker and W. Dittrich, “Parallel Algorithms for Image Processing: Practical Algorithms with Experiments,” International Parallel Processing Symposium, IEEE Computer Society Press, 1996, pp. 429–433.
4. G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, “A Comparison of Sorting Algorithms for the Connection Machine CM-2.,” in Proc. ACM Symp. on Parallel Algorithms and Architectures, 1991, pp. 3–16.
5. E. Cáceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S.W. Song, “Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP,”, on-line Postscript at http://www.scs.carleton.ca/scs/faculty/dehne.html.