Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Tuple Spaces


Related Topics

In the News (Tue 22 Dec 09)

  
  Cover Pages: Tuple Spaces and XML Spaces
The tuples are retrieved by an object-oriented associative mechanism.
The concept of tuple space has been reinterpreted in context of XML so that a tuple is an XML document with some aspects of the document used as tuple data and rest as payload.
The information in the tuple space is asynchronous because the data may be there long after the application that placed it in the space has stopped executing.
xml.coverpages.org /tupleSpaces.html   (5000 words)

  
 T Spaces
They augmented the standard tuple matching algorithm to allow a template and a tuple to match if the type of the tuple is an instance of the type of the template--in which case, the object in the tuple can implement the object in the template.
For a tuple to match an object compatibility template (known as a Subclassable Tuple template), the type of the tuple in the space must be a subclass of the type of the template.
In T Spaces terminology, the join is a user-defined, not a built-in, operator (scan the tuples with the specified column names, perform a "query" operation, and a merge) that directly matches existing tuples.
www.research.ibm.com /journal/sj/373/wyckoff.html   (10059 words)

  
 Ruple: an XML Space Implementation
Tuple spaces were created at Yale University in the mid-1980's as part of the Linda coordination language, where they were used to coordinate interactions within parallel applications.
Some tuple space implementations, including Ruple, provide a way for tuples to expire, to be deleted once their designated lifetime is gone.
Document-centric tuple spaces, with their ability to temporally decouple a sender from a receiver, are ideal for implementing applications that involve intermittently connected devices such as PDAs, cell phones, and Communicators.
www.idealliance.org /papers/xmle02/dx_xmle02/papers/04-05-03/04-05-03.html   (3248 words)

  
 Tuple Spaces - Research - VerticalNet, Inc.
Tuple Spaces evolved from early Blackboard Architecture research within the field of AI [IBM].
Tuple Space agents are said to be "decoupled" in that their processes communicate via messages distributed via a "space".
Rather than simply removing a message from a tuple space, it may be more appropriate for an agent that wishes to act exclusively on the message to negotiate this with the sending agent.
alumnus.caltech.edu /~croft/research/agent/tuplespaces   (1844 words)

  
 The T Spaces Vision
T Spaces is a network communication buffer with database capabilities that enables communication between applications and devices in a network of heterogeneous computers and operating systems.
Object compatibility: For a tuple to match an object compatibility template (known as a SubclassableTuple template), the type of the tuple in the space must be a subclass of the type of the template.
The Admin T Space is used to retrieve all the groups the client executing a command belongs to and the mapping of groups to Attributes (i.e., which groups are allowed to do which operations).
www.almaden.ibm.com /cs/TSpaces/html/TSRole.html   (7077 words)

  
 [No title]   (Site not responding. Last check: 2007-10-13)
So, this is the template, and the first tuple found that has the same fields with the value 33 in the age subfield will be returned regardless of the values in the other fields.
So, this is the template, and again the first tuple found that has the same fields with the value 33 in the age subfield will be returned and removed from the XML-space regardless of the values in the other fields.
And the depth of a tuple is determined by the deepest subfield in it.
www.eecs.umich.edu /~jag/eecs684/presentations/xspace.ppt   (2686 words)

  
 Concurrent Programming CS 598 Class Notes
A data tuple (or just tuple) is a sequence of 1 or more values.
Tuple spaces evolved into a coordination language for adding concurrency to sequential languages.
A tuple space is a distributed, associative memory.
bluehawk.monmouth.edu /rclayton/web-pages/u03-598/ts.html   (942 words)

  
 Lime in a Nutshell   (Site not responding. Last check: 2007-10-13)
Despite the illusion that Lime creates of a single shared memory space (the federated tuple space), it is inherently a distributed system and the tuples in the tuple spaces are physically stored across the multiple hosts in the system.
In fact, each tuple is associated with a single agent (indicated in the figure by the color), and each tuple associated with an agent is stored on the same host where the agent is resident.
The ability to specify a weak reaction on the whole federated tuple space is an extremely powerful programming tool, as it allows the programmer to describe once and for all the actions to be performed in response to a given event, independent of any changes in the system configuration.
lime.sourceforge.net /info/nutshell.html   (1969 words)

  
 [No title]
T Spaces: The design, architecture, and implementation Following the Tuplespace model, a T Spaces client communicates with a T Spaces server via tuples--ordered vectors of fields, each describing a type and a value.
tuple is found, and since it is a read query and not a take, a copy of the tuple is returned to client 2.
A tuple with three fields: (1) No Yes a float with the value 2.24, (2) a string with the value "hello world", and (3) a float with the value 345.0.
www.research.ibm.com /journal/sj/373/wyckoff.txt   (11083 words)

  
 : Class LimeSystemTupleSpace
Operations which modify the tuple space are not allowed.
If no matching tuple is present the operation blocks until such a tuple can be actually found in the tuple space.
The operation is performed atomically, i.e., even if some of the reactions become suddenly enabled by the current state of the tuple space, none can fire until all of them have been registered.
lime.sourceforge.net /api/lime/LimeSystemTupleSpace.html   (592 words)

  
 James Strachan's Weblog
A tuple space can be used in this manner too, but its API is more random access, getting/taking based on a predicate one object at a time.
For me the main differences between MOM and tuple spaces is that with a MOM you typically subscribe to a selection of events (event based); whereas in a tuple space you tend to ask for them one at a time (random access).
Many tuple space use cases and examples are the decoupled producer-consumer worker pattern which is similar to using queues in a MOM to load balance work across a number of processes.
radio.weblogs.com /0112098/2004/09/03.html   (516 words)

  
 October Meeting
At the heart of JavaSpaces is the tuple spaces models - an associative memory that provides a repository for tuples.
Tuples are accessed not by their address but rather by their content and type.
Tuple spaces are thus used to provide inter-process coordination.
www.cooug.org /java/presentations/october2004   (420 words)

  
 Wikis in Tuple Spaces 
We consider storing the pages of a wiki in a tuple space and the effects this might have on the wiki experience.
In particular, wiki pages are stored in tuples with a few identifying values such as title, author, revision date, content, etc. and pages are retrieved by sending the tuple space templates, such as one that gives the title but nothing else, leaving the tuple space to resolve to a single tuple.
We use a tuple space wiki to avoid deadlocks, infinite loops, and wasted efforts when page edit contention arises and examine how a tuple space wiki changes the wiki experience.
homepage.mac.com /redbird/iblog/GWPublications/C1045275013/E503388173   (114 words)

  
 PyLinda: PyLinda - Distributed Computing Made Easy
Linda is an widely studied distributed computing environment, centered around the notion of a tuple space.
A tuple space is a bag (also called a multi-set) of tuples.
Tuple spaces exist independently of processes in the system, and the data placed into a tuple space also exist independently.
www-users.cs.york.ac.uk /~aw/pylinda   (734 words)

  
 Diary for titus
I first ran across tuple spaces when I implemented one without really knowing that it was a tuple space.
My batchqueue implementation for Cartwheel is based on the tuple space concept, although it's more like a queue the way it's implemented.
While my tuple space implementation on top of PostgreSQL isn't well suited for speedy turnaround (typically picking up a job requires up to 1 second), it was absolutely trivial to implement: literally, something like 5 lines of code.
www.advogato.org /person/titus/diary.html?start=3   (1335 words)

  
 Tuple space based coordination languages; beyond Linda   (Site not responding. Last check: 2007-10-13)
The tuple streaming included a sort of event model within the language, however, unfortunately this work was overtaken slightly by the work on JavaSpaces and TSpaces, which also included the concept.
I have never been keen on using transactions in a tuple space coordination languages because they alter the semantics of the primitives being performed inside the transaction and WCL did not provide them.
The idea behind tuple ghosting is that a tuple can remain partially visible beyond the time when it has been returned as the result of a destructive tuple space read operation, such as a Linda in.
research.microsoft.com /~antr/coord.htm   (1828 words)

  
 TupleSpace4J - TopicSpaces   (Site not responding. Last check: 2007-10-13)
TopicSpaces is a topic map engine built on tuple space technology as implemented in TupleSpace4J.
The fundamental construct of the topic map paradigm, the assertion, can be readily represented as a tuple, and hence managed in a tuple space.
Agents interacting with the tuple space will perform routine topic map maintenance and management functions such as merging, federation, querying via the template mechanism, making new associations, and so forth.
www.nexist.org /ts4j/TopicSpaces   (209 words)

  
 Diamond Theory References   (Site not responding. Last check: 2007-10-13)
With its successor volumes, Finite projective spaces over three dimensions (1985), which is devoted to three dimensions, and General Galois geometries (1991), on a general dimension, it provides the only comprehensive treatise on this area of mathematics.
Part I gives a survey of finite fields and an outline of the fundamental properties of projective spaces and their automorphisms; it includes the properties of algebraic varieties and curves used throughout the book and in the companion volumes.
From preface: "This book is an introduction to the geometry of euclidean, affine, and projective spaces with special emphasis on the important groups of symmetries of these spaces." Finite geometry is treated alongside characteristic-zero geometry.
www.m759.freeservers.com /refs.html   (4893 words)

  
 Safer Tuple Spaces - van der Goot, Schae, Wilson (ResearchIndex)   (Site not responding. Last check: 2007-10-13)
The simplicity and elegance of the Linda programming model is based on its single, global, typeless tuple space.
First, the tuple space can be an impediment to scalable high performance.
Second, the "fl box" nature of the tuple space makes it an inherently dangerous data structure, prone to many types of programming errors.
citeseer.ist.psu.edu /129805.html   (390 words)

  
 First-order Model Theory
One central idea of Morley's analysis was that models of an uncountably categorical theory have the smallest possible number of types of element; this led directly to the branch of model theory called stability theory, which studies theories that have a limited number of element types.
These theories have the remarkable property that every infinite indiscernible sequence in any of their models is indiscernible under any linear ordering whatever; so these sequences are a kind of generalisation of bases of vector spaces.
In terms of this dependence relation one can define a dimension for the model, and what remains of the model outside the core is so closely tied to the core that the dimension determines the model up to isomorphism.
plato.stanford.edu /entries/modeltheory-fo   (6179 words)

  
 alphaWorks : TSpaces : Overview
TSpaces is a set of network communication buffers called tuple spaces and a set of APIs (and classes that implement the API) for accessing those buffers.
Data can outlive its producer (because once it's produced, it lives in tuple space) and can be produced before the receiver exists.
Sender and receiver only need to know about tuple space, which mediates all communication.
www.alphaworks.ibm.com /formula/tspaces   (351 words)

  
 Ted Leung on the air : RSS Content Pipelines or Tuple Spaces
The kind of architecture that he is describing is precisely the kind of architecture that I'd like to see a next generation RSS aggregator use.
On interesting variation on this would be to use a tuple space instead of a pipeline, and have the web services get and put RSS items into the space.
Actually, it's kind of an interesting idea to figure out how to make WS-Routing work in a tuple space kind of environment.
www.sauria.com /blog/computers/internet/weblogs/140   (345 words)

  
 Tuple spaces   (Site not responding. Last check: 2007-10-13)
Hmm, I think we've had the microscopic discussion of REST vs. tuple spaces before, but the point I'm making relates more to the macro view.
if tuple spaces can be considered some sort of unifying architecture for integrating other systems together (as you mentioned), why can't REST be that too?
Your use of this web site or any of its content or software indicates your agreement to be bound by these Terms of Participation.
weblogs.java.net /cs/user/view/cs_msg/2087   (86 words)

  
 Re: XML "tuple spaces" alpha technology demonstrated   (Site not responding. Last check: 2007-10-13)
At 23:43 26/12/2001 -0500, Gavin Thomas Nicol wrote: >Seems to me that "Ruple" is pretty trivial to implement given a reasonable >underlying database.
The think about TupleSpaces that pops my cork is the simple conceptualization of a http based read/write information space for XML instances.
Previous by thread: Re: XML "tuple spaces" alpha technology demonstrated
www.stylusstudio.com /xmldev/200112/post90740.html   (231 words)

  
 Trends in Middleware Systems - Selected Topics and Concepts - Spring 2003.
While it aims at highlighting trends within the middleware space, it also tries to conceptualize and identify fundamental principles of middleware systems.
Moreover, the course is interwoven with so called "expert topics".
Topics covered: Linda computing with Linda tuple space model and applications relationship to p/s
www.eecg.toronto.edu /~jacobsen/courses/ece1770/index-03.html   (2420 words)

  
 [No title]
Ÿ¡ª ðÍ¢ ð  ð`€ü{…‡¿ƒ¿ Àÿ?¿ÿ?„†ðЀþ ð ð=Ÿ¨ Tuple Space¡  ðñ¢ ð  ð`€Ä{…‡¿ƒ¿ Àÿ?¿ÿ?„†ðàÐÒÇ ðaŸ¨ (req, P, 7)¡  ªðó¢ ð   ð`€Œ{…‡¿ƒ¿ Àÿ?¿ÿ?„†ðА  ·  ðcŸ¨ (rsp, Q, 8.1)¡ª ðË¢ ð   ð`€¤{…‡¿ƒ¿ Àÿ?¿ÿ?„†ð€ ?
Each server may read the commands in a different order.
Inefficient¡6Œ Œ êrªõ¯žª<âX þÿÿÿþÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿþÿÕÍ՜.“—+,ù®0Àˆ¨´¼ÄÌ Ô Üä ìôü  `äOn-screen ShowIBMpâ¯2  ArialTahoma WingdingsMath BMath CBlendsTuple Spaces and JavaSpaces Tuple SpacesView of a Tuple SpaceTuple Types: Simple CaseFormal vs. Actual ParametersStructured NamingStructured Naming Concurrency PropertiesActive MonitorsLockingDistributed NamingDistributed NamingContinuation PassingContinuation PassingImplementationLinda Ordering Problems JavaSpacesJavaSpaces OverviewTypingTimeouts and Liveness Transactions Reliability Conclusions  Fonts UsedDesign Template Slide Titles
www.cs.cornell.edu /courses/cs614/2002sp/TupleSpaces.ppt   (513 words)

  
 Software Engineering [CiteSeer; NEC Research Institute; Steve Lawrence, Kurt Bollacker, Lee Giles]   (Site not responding. Last check: 2007-10-13)
Most work on program slicing to date has concentrated on finding slices of programs involving only scalar variables.
This paper describes two case studies in which requirements for new flight-software subsystems on NASA's Space Shuttle were analyzed, one using standard formal specification techniques, the other usin...
Its main feature is a labelling function using arguments to compute heuristic in...
sherry.ifi.unizh.ch /SoftwareEngineering   (7359 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.