SSCRAP: An Environment for Coarse Grained Algorithms

Mohamed Essaïdi (1) , Isabelle Guérin Lassous (2) , Jens Gustedt (1)

1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
2 ARES - Architectures of networks of services

In this paper we present SSCRAP an environment for the development of coarse grained algorithms which is well suited for regular as well as irregular problems. SSCRAP implements the currently known coarse grained models on distributed memory architectures as well as on shared memory architectures. It allows for a high-level algorithm design and handles communication and synchronization aspects efficiently at the same time. By making the communication level transparent for the user it guarantees a good portability. SSCRAP has also a fine execution analysis: users are able to compare efficiency of algorithms and to check the predictability level of the considered theoretical complexity.

Mots clés: architectures parallèles; complexity analysis; parallèlisme à gros grain; coarse grained parallel model; parallel architectures; communication interfaces; interfaces de communication

Domaines: Autre [cs.OH]

Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt. SSCRAP: An Environment for Coarse Grained Algorithms. 14th IASTED International Conference on Parallel and Distributed Computing and Systems - PDCS'2002, Nov 2002, Boston, MA, USA, pp.398-403. ⟨inria-00100850⟩