T Spaces

Wyckoff, P.; McLaughry, S.W.; Lehman, Tobin J.; Ford, Daniel Alexander

doi:10.1147/sj.373.0454

Cited by 299 publications

(160 citation statements)

References 17 publications

Supporting

Mentioning

155

Contrasting

Unclassified

Order By: Relevance

“…IBM's TSpaces is a small footprint Java implementation of a tuplespace server (Wyckoff et al, 1998). While comparable to JavaSpaces, TSpaces adds more advanced operator and database functionality so that it can support more complex applications.…”

Section: Background Knowledgementioning

confidence: 99%

Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art

Nixon

Simperl

Krummenacher

et al. 2008

The Knowledge Engineering Review

View full text Add to dashboard Cite

Semantic technologies promise to solve many challenging problems of the present Web applications. As they achieve a feasible level of maturity, they become increasingly accepted in various business settings at enterprise level. By contrast, their usability in open environments such as the Webwith respect to issues such as scalability, dynamism and openness-still requires additional investigation. In particular, Semantic Web services have inherited the Web service communication model, which is primarily based on synchronous message exchange technology such as remote procedure call (RPC), thus being incompatible with the REST (REpresentational State Transfer) architectural model of the Web. Recent advances in the field of middleware propose 'semantic tuplespace computing' as an instrument for coping with this situation. Arguing that truly Webcompliant Web service communication should be based, analogously to the conventional Web, on shared access to persistently published data instead of message passing, space-based middleware introduces a coordination infrastructure by means of which services can exchange information in a time-and reference-decoupled manner. In this article, we introduce the most important approaches in this newly emerging field. Our objective is to analyze and compare the solutions proposed so far, thus giving an account of the current state-of-the-art, and identifying new directions of research and development.

show abstract

Section: Background Knowledgementioning

confidence: 99%

Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art

Nixon

Simperl

Krummenacher

et al. 2008

The Knowledge Engineering Review

View full text Add to dashboard Cite

show abstract

“…In traditional Linda systems, like TSpaces [8] and JavaSpaces [3], the tuple space is a centralized and global data structure that runs in a pre-defined service provider. In the base station scenario this server can easily be located in the fixed network.…”

Section: Introductionmentioning

confidence: 99%

A Coordination Model for ad hoc Mobile Systems

Valente

Pereira

Bigonha

et al. 2003

Euro-Par 2003 Parallel Processing

View full text Add to dashboard Cite

Abstract. The growing success of wireless ad hoc networks and portable hardware devices presents many interesting problems to system engineers. Particular, coordination is a challenging task, since ad hoc networks are characterized by very opportunistic connections and rapidly changing topologies. This paper presents a coordination model, called PeerSpaces, designed to overcome the shortcomings of traditional coordination models when used in ad hoc networks.

show abstract

“…Interest in the use of Linda-like coordination for open systems has increased recently with the introduction of systems like Sun's JavaSpaces [12] and IBM's TSpaces [31], which marry a Linda-like tuplespace to the Java programming language. These systems are envisioned as a kind of universal "network dialtone", a communications fabric that a wide array of divergent systems can use to communicate with each other.…”

Section: Introductionmentioning

confidence: 99%

Safe tuplespace-based coordination in multiagent systems

Minsky

Ungureanu

2001

Applied Artificial Intelligence

View full text Add to dashboard Cite

Linda is a high level coordination model which allows agents to interact via shared tuplespaces without knowing each other's identities and without having to arrange for a definite rendezvous. This high level of abstraction would make Linda particularly suitable for use as a coordination model for heterogeneous distributed systems, if it were not for the fact that the Linda communication is unsafe.In order to enhance the safety of tuplespaces, this paper introduces a mechanism for establishing security policies that regulate agent access to tuplespaces. Our mechanism is based on a previously published concept of law-governed interaction. It makes a strict separation between the formal statement of a policy, which we call a "law," and the enforcement of this law, which is carried our by a set of policy-independent trusted controllers. A new policy under this scheme is created basically by formulating its law, and can be easily deployed throughout a distributed system. Two examples policies are discussed here in detail: one ensures a secure bidding policy; the other prevents denial of service, by regulating the flow of requests sent to the tuplespaces.

show abstract

T Spaces

Cited by 299 publications

References 17 publications

Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art

Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art

A Coordination Model for ad hoc Mobile Systems

Safe tuplespace-based coordination in multiagent systems

Contact Info

Product

Resources

About