Communications directed by bound types in Linda: presentation and formal model

Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to so...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on parallel and distributed systems Ročník 13; číslo 8; s. 828 - 843
Hlavní autori: Gibaud, A., Thomin, P.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Application software
Associative memory
Computer architecture
Computer networks
Concurrent computing
Distributed computing
Matching
Mathematical models
Parallel processing
Parallel programming
Power generation economics
Power system economics
Programming
Semantics
Variable speed drives
ISSN:1045-9219, 1558-2183
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show that this model suffers from the false matching phenomenon. We explain under which conditions this problem occurs, we examine the solutions already proposed to solve it, and we show why they are not sufficient. In this framework, our goal is to propose an extension to the Linda model in order to eliminate the false matching phenomenon. This model-Linda with bound types or B-Linda-suitable for modern programming paradigms, adds an extended-type notion into the basic Linda model. It is first introduced in an informal manner, then we present an implementation of it. Some formal aspects are specified in the appendix: The definition of the model's elements and operational semantics.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2002.1028439