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
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : 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.
Type de document :
Communication dans un congrès
S.G. Akl et al. 14th IASTED International Conference on Parallel and Distributed Computing and Systems - PDCS'2002, Nov 2002, Boston, MA, USA, IASTED, pp.398-403, 2002
Liste complète des métadonnées

https://hal.inria.fr/inria-00100850
Contributeur : Jens Gustedt <>
Soumis le : mardi 26 septembre 2006 - 14:52:25
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

Identifiants

  • HAL Id : inria-00100850, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

198