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

Full description

Bibliographic Details

Published in:	IEEE transactions on parallel and distributed systems Vol. 13; no. 8; pp. 828 - 843
Main Authors:	Gibaud, A., Thomin, P.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2002 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!