E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping et al., Efficient parallel graph algorithms for coarse grained multicomputers and BSP, Automata, Languages and Programming Proceedings of the 24th International Colloquium ICALP'97, pp.390-400, 1997.
DOI : 10.1007/3-540-63165-8_195

A. Chan and F. K. Dehne, CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters, PVM/MPI, pp.117-125, 2003.
DOI : 10.1007/978-3-540-39924-7_20

M. Essa¨?diessa¨?di, I. G. Lassous, and J. Gustedt, SSCRAP: An environment for coarse grained algorithms, Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems, pp.398-403, 2002.

M. Essa¨?diessa¨?di, I. G. Lassous, and J. Gustedt, SSCRAP: Soft synchronized computing in rounds for adequate parallelization, 2004.

M. Essa¨?diessa¨?di, Echange de données pour le parallélismè a gros grain, 2004.

I. G. Assefaw-hadish-gebremedhin, J. Lassous, J. A. Gustedt, and . Telle, PRO: a model for parallel resource-optimal computation, 16th Annual International Symposium on High Performance Computing Systems and Applications, pp.106-113, 2002.

V. Alexandros, L. G. Gerbessiotis, and . Valiant, Direct Bulk- Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing, vol.22, issue.2, pp.251-267, 1994.

I. Guérin, L. , and J. Gustedt, Portable list ranking: an experimental study, ACM Journal of Experimental Algorithmics, vol.7, issue.7, 2002.

F. Jop and . Sibeyn, Ultimate Parallel List Ranking, Proceedings of the 6th Conference on High Performance Computing, pp.191-201, 1999.

L. G. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181