Efficient Parallel Programming with Linda

Efficient Parallel Programming with Linda

Linda is a coordination language inverted by David Gelernter at Yale University, which when combined with a computation language (like C) yields a high-level parallel programming language for MIMD machines. Linda is based on a virtual shared associative memory containing objects called tuples. Skept...

Full description

Bibliographic Details
Main Authors: Ashish Deshpande, Martin Schultz
Format: Article
Language:English
Published: Hindawi Limited 1992-01-01
Series:Scientific Programming
Online Access:http://dx.doi.org/10.1155/1992/829092
id doaj-ec76ce6a1fe84c76a4855cde975d2c54
record_format Article
spelling doaj-ec76ce6a1fe84c76a4855cde975d2c542021-07-02T09:24:18ZengHindawi LimitedScientific Programming1058-92441875-919X1992-01-011217718310.1155/1992/829092Efficient Parallel Programming with LindaAshish Deshpande0Martin Schultz1Department of Computer Science, Yale University, New Haven, CT 06520, USADepartment of Computer Science, Yale University, New Haven, CT 06520, USALinda is a coordination language inverted by David Gelernter at Yale University, which when combined with a computation language (like C) yields a high-level parallel programming language for MIMD machines. Linda is based on a virtual shared associative memory containing objects called tuples. Skeptics have long claimed that Linda programs could not be efficient on distributed memory architectures. In this paper, we address this claim by discussing C-Linda's performance in solving a particular scientific computing problem, the shallow water equations, and make comparisons with alternatives available on various shared and distributed memory parallel machines.http://dx.doi.org/10.1155/1992/829092
collection DOAJ
language English
format Article
sources DOAJ
author Ashish Deshpande
Martin Schultz
spellingShingle Ashish Deshpande
Martin Schultz
Efficient Parallel Programming with Linda
Scientific Programming
author_facet Ashish Deshpande
Martin Schultz
author_sort Ashish Deshpande
title Efficient Parallel Programming with Linda
title_short Efficient Parallel Programming with Linda
title_full Efficient Parallel Programming with Linda
title_fullStr Efficient Parallel Programming with Linda
title_full_unstemmed Efficient Parallel Programming with Linda
title_sort efficient parallel programming with linda
publisher Hindawi Limited
series Scientific Programming
issn 1058-9244
1875-919X
publishDate 1992-01-01
description Linda is a coordination language inverted by David Gelernter at Yale University, which when combined with a computation language (like C) yields a high-level parallel programming language for MIMD machines. Linda is based on a virtual shared associative memory containing objects called tuples. Skeptics have long claimed that Linda programs could not be efficient on distributed memory architectures. In this paper, we address this claim by discussing C-Linda's performance in solving a particular scientific computing problem, the shallow water equations, and make comparisons with alternatives available on various shared and distributed memory parallel machines.
url http://dx.doi.org/10.1155/1992/829092
work_keys_str_mv AT ashishdeshpande efficientparallelprogrammingwithlinda
AT martinschultz efficientparallelprogrammingwithlinda
_version_ 1721333246156865536

Similar Items