Linda-like systems

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.
gollark: AMD things with integrated graphics have video encoders though?
gollark: Is that compatible with any of them?
gollark: Haskell code might end up terser still, because it's Haskell. That doesn't make it easy to write.
gollark: It lacks most of the things which make Python particularly usable.
gollark: Have you *used* OCaml?

References


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.