Simulating A Shared Associative Memory On A Transputer Network: Linda

Abstract : In this paper we present a Linda implementation on a distributed memory parallel computer. Linda is a parallel programming paradigm providing a small set of extensions to any of the sequential languages such as C, FORTRAN: : : . This paradigm allows the porting of programs between various architectures of parallel computers. It is based on a shared associative memory, namely the tuple space. On distributed memory systems, this shared memory has to be simulated. Our implementation runs on a transputer network with any underlying topology. We first present the Linda operators, then the protocol used to manage the tuple space is described, and a dynamic load balancing scheme is also presented.
Type de document :
Communication dans un congrès
Alain Pave. Modelling and Simulation ESM'93, Jun 1993, Lyon, France. pp. 628-631, 1993
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00947759
Contributeur : Florent Breuil <>
Soumis le : lundi 17 février 2014 - 13:16:31
Dernière modification le : mardi 22 mars 2016 - 01:16:36

Identifiants

  • HAL Id : emse-00947759, version 1

Citation

Michel Beigbeder, Annie Corbel, Franck Fleter. Simulating A Shared Associative Memory On A Transputer Network: Linda. Alain Pave. Modelling and Simulation ESM'93, Jun 1993, Lyon, France. pp. 628-631, 1993. 〈emse-00947759〉

Partager

Métriques

Consultations de la notice

60