Linda (coordination language)
From Wikipedia, the free encyclopedia
In computer science, Linda is a parallel programming language which is implemented as an extension of other (sequential) languages such as Prolog, C, or Java.
It consists fundamentally of four operations: in, rd, out and eval through which tuples (ordered lists of data objects) can be added, retrieved or destructively retrieved from a logical associative memory called a tuplespace. It has been progressively extended to support different types of communication and co-ordination between (open distributed) computer systems, and has aroused some interest in the ubiquitous computing (sTuples), agent and Semantic Web (Triple Spaces, Semantic Web Spaces) communities.
It was developed by David Gelernter and Nicholas Carriero at Yale University. Other researchers in the field include Thomas Kolarik, Andrea Omicini, Gian Pietro Picco, Ronaldo Menezes, Robert Tolksdorf and Gruia-Catalin Roman.
Linda implementations can be found for Prolog, Ruby, C and Java — JavaSpaces is an implementation of Linda in Java by Sun. IBM also has a tuplespace platform named TSpaces.
Later on, Linda was developed to separate family of systems known as Linda-like systems and implemented as orthogonal technology (unlike original version).
The language name seems to be a pun on Ada's tribute to Ada Lovelace [1] and is actually named after another famous Lovelace, Linda Lovelace star of such classic porn films as Deep Throat [2].
