Computer
How to write parallel programs: a first course
How to write parallel programs: a first course
ActorSpace: an open distributed programming paradigm
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
PageSpace: an architecture to coordinate distributed applications on the Web
Proceedings of the fifth international World Wide Web conference on Computer networks and ISDN systems
Hitting the distributed computing sweet spot with TSpaces
Computer Networks: The International Journal of Computer and Telecommunications Networking - pervasive computing
Multiple Tuple Spaces in Linda
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
Law-Governed Linda as a Coordination Model
ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
| Hi-index | 0.00 |
Linda is an elegant parallel and distributed programming model. It is based on a shared associative memory, structured in tuples. We show in this paper 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.