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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 13; H. 8; S. 828 - 843
Hauptverfasser:	Gibaud, A., Thomin, P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.08.2002 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!