Portable List Ranking: an Experimental Study

Isabelle Guérin Lassous 1, 2 Jens Gustedt 3
2 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms.
Type de document :
Communication dans un congrès
Stefan Näher & Dorothea Wagner. WAE 2000 - Workshop on Algorithm Engineering, 2000, Saarbrücken, Germany. Springer, 1982, pp.111-122, 2001, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007%2F3-540-44691-5_10〉. 〈10.1007/3-540-44691-5_10〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00099383
Contributeur : Jens Gustedt <>
Soumis le : mardi 26 septembre 2006 - 08:53:34
Dernière modification le : mardi 16 janvier 2018 - 15:50:48

Identifiants

Collections

Citation

Isabelle Guérin Lassous, Jens Gustedt. Portable List Ranking: an Experimental Study. Stefan Näher & Dorothea Wagner. WAE 2000 - Workshop on Algorithm Engineering, 2000, Saarbrücken, Germany. Springer, 1982, pp.111-122, 2001, Lecture Notes in Computer Science. 〈http://link.springer.com/chapter/10.1007%2F3-540-44691-5_10〉. 〈10.1007/3-540-44691-5_10〉. 〈inria-00099383〉

Partager

Métriques

Consultations de la notice

172