Tuple spaces implementations and their efficiency · HackerPapers discussions

Tuple spaces implementations and their efficiency — mentioned by imglorp

Fri, 28 Apr 2023 22:22:33 GMT

Tuple spaces implementations and their efficiency - 2016 https://arxiv.org/pdf/1612.02979.pdf > SUMMARY > Among the paradigms for parallel and distributed computing, the one popularized with Linda, and based on tuple spaces, is one of the least used, despite the fact of being intuitive, easy to understand and to use. A tuple space is a repository, where processes can add, withdraw or read tuples by means of atomic operations. Tuples may contain different values, and processes can inspect their content via pattern matching. The lack of a reference implementation for this paradigm has prevented…

Paper and discussion history. A mention is not an endorsement.

Tuple spaces implementations and their efficiency — mentioned by makmanalp

Sun, 29 Jul 2018 05:36:06 GMT

It's better to think of tuple spaces as a concurrency / communications model than an implementation. So it's more like "the actor model" rather than Erlang's or Java/Akka's specific implementation of it. It's more about "if we had this type of system with these constraints and these features, abstracting away these details, what would we gain or lose?". You're right that in the end a good or bad implementation can make or break things (take a look at this paper: https://arxiv.org/abs/1612.02979), but that's not the point, at least with the original paper. The interesting thoughts from the…

Paper and discussion history. A mention is not an endorsement.