N. Carriero, D. Gelernter, and L. Zuck. Bauhaus-Linda. In Object-Based Models and Languages for Concurrent Systems, LNCS 924. Springer, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the atomic removal of the tuples representing its local context from the remaining group context. In general, whole groups can merge, and a group can split into several groups due to changes in connectivity. In LIME, agents may have multiple ITSs distinguished by a name since this is recognized [7] as a useful abstraction to separate related application data. The sharing rule in the case of multiple tuple spaces relies on tuple space names: only identically named tuple spaces are transiently shared among the members of a group. Thus, for instance, when an agent # owning a single tuple space ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus-Linda. In Workshop on Languages and Models for Coordination, European Conference on Object Oriented Programming, 1994.

....them. If space is a ts variable, then in( space) will match a tuple space, withdraw it and suspend all active computations in it and bind an image of it to the local variable space. To reinsen space, eval(space) has to be executed. This will also reactivate all suspended computations. BAUHAUS ([11]) doesn t differentiate between tuples, tuple spaces, templates, active and passive tuples. Instead, a single structure called multiset (mset) is used for all. In multisets, there is no order of fields like in tuples. Msets are matched by existence of elements in them. A BAUHAUS agent can only ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus-Linda. In Workshop on Languages and Models for Coordination, European Conference on Object Oriented Programming, 1994.

....ones which are tailor made for requirements such as speed, security and fault tolerance. For the above reasons, many researchers concluded that it was necessary for Linda to embrace multiple distinct tuple spaces and a number of prototype solutions have appeared, as described below [Bakken,94] Carriero,94] Douglas,95] Hupfer,90] Minsky,94] FT Linda is a variant of Linda designed to support fault tolerant applications through properties such as tuple stability, multiple operation atomicity and strong semantics [Bakken,94] The FT Linda model features a collection of processors connected ....

....provides just one stable, shared tuple space for all applications. Further tuple spaces are dynamically created in response to application requests. Bauhaus Linda Bauhaus Linda, also known as Bauhaus, features an extended tuple space model which accommodates a hierarchy of multiple tuple spaces [Carriero,94] In Bauhaus, parts of the tuple space hierarchy can be dynamically created and destroyed using the same Linda primitives as those used to create and consume tuples i.e. 5n, out and rd. This means that, for example, using 5n to withdraw a tuple space also withdraws the part of the tuple space ....

[Article contains additional citation context not shown here]

N. Carriero, D. Gelernter and L. Zuck, "Bauhaus Linda", Selected Papers from the Workshop on Models and Languages for Coordination of Parallelism and Distribution (ECOOP '94), Bologna, Italy, July 1994, pp 66-76.

.... include Java [30] Odyssey [15] Aglets [19] Voyager [24] and the latest revisions of the Internet protocol [25, 2] In addition to these commercial efforts, many prototype languages have been developed and implemented within the programming language research community examples include Linda [8, 9], Facile [16] Obliq [7] Infospheres [11] the join calculus [13] and Nomadic Pict [33] In this paper we address the issue of resource access control for such languages. Central to the paradigm of mobile computation are the notions of agent, resource and location. Agents are effective entities ....

....whereas the type system of Kobayashi et al. 21] ensures that some channels are used linearly. The work closest to ours is that of de Nicola, Ferrari and Pugliese [10] Their goals are the same as ours, but the specifics of their solution are quite different. They work with a variant of Linda [9] with multiple tuple spaces . Tuple spaces correspond to locations in our setting, and tuples (named data) correspond to resources. The type system of [10] controls access to tuple spaces, rather than specific tuples. In order to acheive the fine level of control provided by our system, 10] ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, number 924 in Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, 1995.

....primitives, Linda uni es the concepts of process creation, communication and synchronization since they are all implemented as tuple space operations. There are several variants of the Linda model (called nowadays the Linda family of models) among which deserve mentioning: Melinda [15] Bauhaus [5], PageSpace [6] and Bonita [25] Despite their di erences all the models would su er from the same problem should they be implemented in open environments: memory exhaustion. 2.3 Open Implementations One might wonder why the memory exhaustion problem has not been felt to a great extent so far. ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66-76. Springer-Verlag, Berlin, 1995.

....others di#er significantly from it. These derivatives aim to improve and extend the basic model with multiple tuple spaces, enforcement of security and protection of the data posted to the tuple space, etc. Some of these proposals will be described promptly. 3.2. 2 Bauhaus Linda Bauhaus Linda ([22]) is a direct extension of the vanilla Linda model featuring multiple tuple spaces implemented in the form of multisets (msets) Bauhaus Linda does not di#erentiate between tuples and tuple spaces, tuples and anti tuples (i.e. tuple templates) and active and passive tuples. Instead of adding ....

N. Carriero, D. Gelernter and L. Zuck, "Bauhaus Linda", in [29], pp. 66--76.

.... aim at, e.g. adding programmability to tuple spaces by associating reaction rules to communication events [23, 24, 4, 5] creating dynamically private tuple spaces [27, 11, 2] allowing processes to transiently share their own tuple spaces [25] structuring hierarchically tuple spaces [9, 8, 24], restricting (the form of the tuples that can be put into) tuple spaces and the pattern matching mechanism [18] or the operations that processes can perform over tuple spaces [12, 13] Future work In [12, 13] a type system for Klaim is presented that permits checking access rights violations ....

N. Carriero, D. Gelernter, L. Zuck. Bauhaus Linda. In [10], pp.66-76, 1995.

....that tries to make the software itself reliable to run for a long period of time. Distributed I O is also not addressed. Bonita proposes a new way to access tuple spaces. Any flaw that a LINDA system presents in terms of handling I O is also present in Bonita. 2.1. 8 Bauhaus Bauhaus LINDA [CGZ95] was originally proposed so as to fill some gaps left by the multiple tuple space LINDA model [Gel89] Carriero et al. argue that the multiple tuple spaces lacked at least two important characteristics: multiple first class tuple spaces and operators to unify the way objects stored with tuple ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, Berlin, 1995.

.... include Java [27] Odyssey [14] Aglets [17] Voyager [22] and the latest revisions of the Internet protocol [23, 2] In addition to these commercial efforts, many prototype languages have been developed and implemented within the programming language research community examples include Linda [7, 8], Facile [15] Obliq [6] Infospheres [10] and the join calculus [12] In this paper we address the issue of resource access control for such languages. Central to the paradigm of mobile computation are the notions of agent, resource and location. Agents are effective entities that perform ....

....Resource Access Control in Systems of Mobile Agents 44 ensures that some channels are used linearly. The work closest to ours is that of de Nicola, Ferrari and Pugliese [9] Their goals are the same as ours, but the specifics of their solution are quite different. They work with a variant of Linda [8] with multiple tuple spaces . Tuple spaces correspond to locations in our setting, and tuples (named data) correspond to resources. The type system of [9] controls access to tuple spaces, rather than to specific tuples, and thus provides coarser grained control of resource access than that ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, number 924 in Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, 1995.

....to the head, and writing back in the target elements corresponding to the rule body. This idea was explored first in the context of the Gamma language [2] Its application in the object oriented field was suggested by the designers of the LO language [1] The ActorSpace model [3] and Bauhaus [4] also are based on multisets. Another language based on the multiset rewriting model is Shade, a object oriented coordination language [5] In fact, Shade can be seen as a coordination space for active objects. Active objects (agents) react to the stimula coming from their environment, obeying to ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66--76. SpringerVerlag, Berlin, 1995.

.... include Java [27] Odyssey [14] Aglets [17] Voyager [22] and the latest revisions of the Internet protocol [23, 2] In addition to these commercial efforts, many prototype languages have been developed and implemented within the programming language research community examples include Linda [7, 8], Facile [15] Obliq [6] Infospheres [10] and the join calculus [12] In this paper we address the issue of resource access control for such languages. Central to the paradigm of mobile computation are the notions of agent, resource and location. Agents are effective entities that perform ....

....whereas the type system of Kobayashi et al. 19] ensures that some channels are used linearly. The work closest to ours is that of de Nicola, Ferrari and Pugliese [9] Their goals are the same as ours, but the specifics of their solution are quite different. They work with a variant of Linda [8] with multiple tuple spaces . Tuple spaces correspond to locations in our setting, and tuples (named data) correspond to resources. The type system of [9] controls access to tuple spaces, rather than to specific tuples, and thus provides coarser grained control of resource access than that ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, number 924 in Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, 1995.

.... include Java [27] Odyssey [14] Aglets [17] Voyager [22] and the latest revisions of the Internet protocol [23, 2] In addition to these commercial efforts, many prototype languages have been developed and implemented within the programming language research community examples include Linda [7, 8], Facile [15] Obliq [6] Infospheres [10] and the join calculus [12] In this paper we address the issue of resource access control for such languages. Central to the paradigm of mobile computation are the notions of agent, resource and location. Agents are effective entities that perform ....

....Access Control in Systems of Mobile Agents 44 ensures that some channels are used linearly. The work closest to ours is that of de Nicola, Ferrari and Pugliese [9] Their goals are the same as ours, but the specifics of their solution are quite different. They work with a variant of Linda [8] with multiple tuple spaces . Tuple spaces correspond to locations in our setting, and tuples (named data) correspond to resources. The type system of [9] controls access to tuple spaces, rather than to specific tuples, and thus provides coarser grained control of resource access than that ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, number 924 in Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, 1995.

.... include Java [24] Odyssey [11] Aglets [15] Voyager [20] and the latest revisions of the Internet protocol [21,1] In addition to these commercial efforts, many prototype languages have been developed and implemented within the programming language research community examples include Linda [5,6], Facile [12] Obliq [4] Infospheres [8] and the join calculus [9] In this paper we address the issue of resource access control for such languages. Central to the paradigm of mobile computation are the notions of agent, resource and location. Agents are effective entities that perform ....

....whereas the type system of Kobayashi et al. 17] ensures that some channels are used linearly. The work closest to ours is that of de Nicola, Ferrari and Pugliese [7] Their goals are the same as ours, but the specifics of their solution are quite different. They work with a variant of Linda [6] with multiple tuple spaces . Tuple spaces correspond to locations in our setting, and tuples (named data) correspond to resources. The type system of [7] controls access to tuple spaces, rather than to specific tuples, and thus provides coarser grained control of resource access than that ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, number 924 in Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, 1995.

....[19] The literature is replete with Linda variants. We mention only multiple tuple spaces as they have some bearing on the discussion. Adding an operation to dynamically create new spaces and tuple space names that can be used as values allows Linda programs to explicitly manage tuple spaces [7, 13, 17, 24]. This in turn can be used to structure communication, for example creating zones restricted to a subset of the processes. Not only do multiple space reduce the risk of programming errors, but they also provide some degree of privacy. For instance one may establish a private channel with the ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of LNCS, pages 66--76. Springer-Verlag, Berlin, 1995.

....Agents 11 In this section bulk primitives were described which moves tuples from one tuple space to another tuple space. Others have proposed the inclusion of primitives which return tuples to a special local data structure within the agent performing the operation, such as in Bauhaus Linda [Carriero et al. 1994] and Objective Linda [Kielmann 1996] The local data structures within the agent require new access mechanisms. In both Bauhaus Linda and Objective Linda the data structure takes the from of a multi set, or in other words a tuple space. Therefore, the tuples are moved from a tuple space, to a ....

Carriero, N., D. Gelernter, and L. Zuck (1994), "Bauhaus Linda," In Object-Based Models and Languages for Concurrent Systems , P. Ciancarini, O. Nierstrasz, and A. Yonezawa, Eds., LNCS 924, Springer-Verlag, pp. 66--76.

....process that is trusted to extract tuples from the space according to some policy, but not to access the contents of the extracted tuples. Linda does not distinguish the removal of a tuple from the reading of its fields. Multiple data spaces have been used to address the access control problem [7, 13, 15, 26] by fulfilling the role of protection domains. In this approach, agents are granted access to a space if they are trusted to manipulate the data in that space and to interact with other agents that have access to the same space. The problem with this approach is that it supposes that each domain ....

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of LNCS, pages 66--76. Springer-Verlag, Berlin, 1995.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus-Linda. In Object-Based Models and Languages for Concurrent Systems, LNCS 924. Springer, 1995.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, ECOOP'94 Workshop, volume 924 of LNCS, pages 66--76, Bologna, Italy, 1995. Springer-Verlag.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus-Linda. In Object-Based Models and Languages for Concurrent Systems, LNCS 924. Springer, 1995.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, volume 924 of Lecture Notes in Computer Science, pages 66--76. Springer-Verlag, Berlin, 1995.

No context found.

Carriero, N., Gelernter, D., and Zuck, L. 1996. \Bauhaus Linda", In Object-based Models and Languages for Concurrent Systems, P. Ciancarini, O. Nierstrasz, A. Yonezawa (eds.), LNCS 924, Springer-Verlag, July, pp.66-76.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems: Proc. of the ECOOP'94 Workshop on Modles and Languages for Coordination of Parallelism and Distribution, pages 66--76. Springer, Berlin, Heidelberg, 1995.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems, ECOOP'94 Workshop, volume 924 of LNCS, pages 66--76, Bologna, Italy, 1995. Springer-Verlag.

No context found.

Carriero, N., Gelernter, D., and Zuck, L. 1996. \Bauhaus Linda", In Object-based Models and Languages for Concurrent Systems, P. Ciancarini, O. Nierstrasz, A. Yonezawa (eds.), LNCS 924, Springer-Verlag, July, pp.66-76.

No context found.

N. Carriero, D. Gelernter, and L. Zuck. Bauhaus Linda. In Object-Based Models and Languages for Concurrent Systems, volume 924, pages 66-76. Springer Verlag, 1995.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC