By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gibaud, A. ; Lab. of Ind. & Human Mech. & Autom. Control, Univ. of Valenciennes & Hainaut-Cambresis, France ; Thomin, P.

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.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:13 ,  Issue: 8 )