Jump to content

Linda-like systems

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 恒冰 (talk | contribs) at 14:01, 13 November 2018 (→‎Examples). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Linda-like systems are parallel and distributed programming models that use unstructured collections of tuples as a communication mechanism between different processes.

Examples

In addition to proper Linda implementations, these include other systems such as the following:

  • Intel Concurrent Collections (CnC) is a programming model based on "item collections" which resemble tuple spaces, but are single assignment (tuples may not be removed or replaced).[1] Because of this restriction Concurrent Collections has a deterministic execution semantics, but has difficulties with storage deallocation.

References

  1. ^ Intel Concurrent Collections (CnC)


Stub icon

This computing article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Linda-like_systems&oldid=868635362"