start | find | index | login or register | edit | ||
Tuple Spaces
by earl, 7698 days ago
Tuple spaces were first described by David Gelernter in Linda in Context [Nicholas Carriero and David Gelernter, 'Linda in Context', CACM 32/4 (1984), pages 444-458].Basically, a tuplespace is a shared datastore (the space) for simple list data structures (tuples). A very simple model is used to access the tuplespace, usually consisting of the operations write (out), take (in), read (rd) and maybe waitToTake, waitToRead, count and scan. Tightly coupled communication, as opposed to space-based communication, is said to require a "rendezvous" in that a sender must know the receiver's location and both sender and receiver must be available at the same time. Contrast to this the "anyone, anywhere, anytime" approach of tuplespaces. See also: JMS, JavaGroups, JCache Tuple Spaces revisited: [create Linda] to TSpaces (Presentation) - http://www.cs.berkeley.edu/~ravenben/research/tuplespace/ Tuple Spaces page at the XML Cover Pages - http://xml.coverpages.org/tupleSpaces.html IBM's TSpaces - http://www.almaden.ibm.com/cs/TSpaces Sun's JavaSpaces - http://java.sun.com/products/javaspaces/ TupleSpaces for Ruby - http://www.ruby-lang.org/en/raa-list.rhtml?name=tuplespace GigaSpaces for Java - http://www.j-spaces.com/ O'Reilly: Space-based programming - http://www.onjava.com/lpt/a/3309 |
search 84 active users
backlinks (more) recent stores (more) echo earlZstrainYat|tr ZY @. |
|
earl.strain.at • esa3 • online for 8692 days • c'est un vanilla site |