Simulating A Shared Associative Memory On A Transputer Network: Linda - Mines Saint-Étienne Access content directly
Conference Papers Year : 1993

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.
No file

Dates and versions

emse-00947759 , version 1 (17-02-2014)

Identifiers

  • HAL Id : emse-00947759 , version 1

Cite

Michel Beigbeder, Annie Corbel, Franck Fleter. Simulating A Shared Associative Memory On A Transputer Network: Linda. Modelling and Simulation ESM'93, Jun 1993, Lyon, France. pp. 628-631. ⟨emse-00947759⟩
42 View
0 Download

Share

Gmail Facebook X LinkedIn More