G.-C. Roman and H. C. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Transactions on Software Engineering, 16(12):1361--73, December 1990.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....we describe in more detail the major members of each one of these two main categories of coordination models and languages. 6 3.2 Data Driven Coordination Models Almost all coordination models belonging to this category have evolved around the notion of a Shared Dataspace. A Shared Dataspace ([64]) is a common, content addressable data structure. All processes involved in some computation can communicate among themselves only indirectly via this medium. In particular, they can post or broadcast information into the medium and also they can retrieve information from the medium either by ....

G.-C. Roman and H. C. Cunningham, "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency", IEEE Transactions on Software Engineering 16 (12), 1990, pp. 1361-- 1373.

....USING link TO ABSTRACT LOCATION This paper proposes that link should have its semantics changed so that what it does is to link an attribute (be it a lename or a location) to a tuple space. These attributes can be interpreted by the kernel. The communication paradigm based on shared dataspaces [12] has inspired even commercial implementations of Linda based systems, such as JavaSpaces [4] and TSpaces [6] Bringing location as an attribute of tuple spaces would greatly improve the suitability of Ligia (and Linda systems) as a framework for implementation of Internet based applications. There ....

G.-C. Roman and H. C. Cunningham. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(12):1361-1373, Dec. 1990.

.... On the contrary, in the previous models for concurrency, a computation is a network of processes that communicate via shared variables and need explicit declaration of producer consumer relationships [18, 19] The tuple space paradigm inspired the design of languages like: Linda [11, 12] Swarm [24], LO [4] Gamma [8] SP [9] ESP [10] PoliS [16] Pat e [3] and eta [1, 2] They are also called coordination languages. The combination of associative access and uncoupling results in a very high expressive power when describing coordination properties of different cooperating entities. All ....

G. C. Roman and H. C. Cunningam. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(2):1361--1376, Dec 1990.

....channel over which the two processes communicate. A new class of parallel languages, conceptually based on concurrent computation inside a shared data space, is emerging. These languages are either imperative, like Linda [14] Associons [30] and Gamma [3] or logic, like Shared Prolog [5] Swarm [31], and LO [1] The shared data space is either a multiset of tuples (Linda, Associons, Gamma) or of logic terms (Shared Prolog, Swarm, LO) Furthermore, communication is based on some form of pattern matching, and is both associative and asynchronous. The common features of these languages suggest ....

Gruia Catalin Roman and H.C.Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Trans. on Software Engineering, 16(12):1361--1373, December 1990.

....missing and perhaps not required since the systems are targeted at sequential algorithm visualization. Indeed as pointed out by Roman and Cox[21] Tango and related systems cannot easily be applied to concurrent programs. The second approach exemplified by the Pavane[22] system as applied to Swarm[23] programs, visualizes program execution by declaring a mapping between program state and the visual representation of that state. Animation is thus a consequence of modifying the state. Our approach of providing a clear semantic framework for animation is predated by the declared intention of the ....

G. C. Roman and H. Cunningham, "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering, vol. 16, pp. 1361-1373, December 1990.

....facets of a process (the interaction with the tuple space and the computation fired by the specified configurations of the tuple space, resp. can be uniformly described by the same formalism. The tuple space paradigm inspired the design of many programming languages, like Linda [18, 20] Swarm [48], LO [7] Gamma [12, 13] Tao [47, 46, 42] manifold [9] SP [14] 3 ESP [17] PoliS [24] Pat e [6] and eta [4, 5] A focussed discussion of the characteristics of some of these languages can be found at the beginning of section 2 1.2 Motivations Our target is the definition of a logical, ....

....connective that resembles the Omega (times) connective of linear logic [30] We contend that the resulting logic is more appealing to software developers. Besides, it turns out that our non idempotent conjunction is a useful operator also when specifying tuple space systems like Swarm systems [48], where the tuple space is a set of tuples. It is fairly common to need to constrain the computation in such a way that no two atoms with a same predicate p appear at the same time in the tuple space. To specify this constraint with the classical we would have to say something like: 2 [ p(x 1 ; ....

G. C. Roman and H. C. Cunningam. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(2):1361--1376, 1990.

....future work. 2 A Declarative, Executable Specification Language: LO As a specification language for our DPS protocols we use LO [3] a declarative concurrent language which amalgamates aspects of concurrent languages based on generative communication, such as CHAM [6] Gamma [5] Linda [8] Swarm [25], as well as of concurrent logic programming languages [9, 10, 15, 19, 32] LO s logical primitives for agent coordination and communication make it particularly suitable for our purposes; on the other hand, our approach is compatible with other choices of a specification language. The LO ....

Roman, G-C., Cunningham, H. C.: Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering 16:12, 1361--1373 (1990)

....of local environment, allowing the formulation of an abstract model of group communication which reflects characteristics of different existing models for communication. We are influenced by models based on generative (or associative) communication, generally realized by data spaces (e.g. Swarm (Roman and Cunningham 1990) , Linda (Carriero and Gelernter 1990) CHAM (Berry and Boudol 1990) Gamma (Ban tre and M tayer 1990) UNITY (Chandy and Misra 1988) and by models based on message passing, e.g. Actors (Agha 1986) The LO model (Andreoli et al. 1992) also combines both aspects: intra pool communication ....

G-C. Roman and H. C. Cunningham. "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency". IEEE Transactions on Software Engineering, 16(12):1361--1373, 1990.

....Pavane [3, 5] They involve one or more worlds (windows) of three dimensional geometric objects, full color, and smooth animation. Each visualization is constructed by writing a set of rules that map program states to graphical representations. Pavane supports rapid visualization of C and Swarm [4] programs. We used the Swarm logic to build the specifications and carry out the refinements, the Swarm programming notation is used to write abstract programs that satisfy the specifications, and Pavane is used to construct the visualizations that convey the design decisions associated with each ....

Roman, G.-C., and Cunningham, H. C., "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1361-1373, 1990.

....and command and control systems. The architecture, named SPLICE, employs a data driven coordination model that is based on a shared data space; in this respect SPLICE bears close resemblance to coordination models and languages like Linda [10] Gamma [5] Log [18] ImpUnity [16] and Swarm [21] (the last two being based on the UNITY language [12] The semantics and implementation of the coordination primitives of SPLICE, however, are strongly tailored towards the specific requirements of distributed control systems. In this paper we present the semantics of SPLICE by means of ....

G.-C. Roman and H.C. Cunningham. Mixed programming metaphors in a shared data space model of concurrency. In IEEE Transactions of Software Engineering 16:12, pages 1361--1373, 1990.

....we describe in more detail the major members of each one of these two main categories of coordination models and languages. 3.2 Data Driven Coordination Models Almost all coordination models belonging to this category have evolved around the notion of a Shared Dataspace. A Shared Dataspace ([64]) is a common, content addressable data structure. All processes involved in some computation can communicate among themselves only indirectly via this medium. In particular, they can post or broadcast information into the medium and also they can retrieve information from the medium either by ....

G.-C. Roman and H. C. Cunningham, "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency", IEEE Transactions on Software Engineering 16 (12), 1990, pp. 1361-1373.

No context found.

G.-C. Roman and H. C. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Transactions on Software Engineering, 16(12):1361--73, December 1990.

....must be explicitly described by the programmer. In other words, when an agent produces some data as output, it does not have to know which agent will take them as input, or if the data will eventually be taken. The tuple space paradigm inspired the design of languages like: Linda [38, 40] Swarm [109], LO [13] Gamma [24, 25] Tao [102, 101] SP [31] ESP [34] PoliS [46] Pat e [12] and eta [4, 6] They are also called coordination languages. The combination of associative access and uncoupling results in a very high expressive power when describing coordination properties of different ....

....of the agent described by thread num gen. Rule G acts as number generator, and generates natural numbers, in the canonical increasing order. 2. 6 Swarm Swarm has been conceived as a tool to reason on programs that exploit the tuple space model rather than a programming or a coordination language [109]. However, it can be considered de facto a tuple space language. Data are represented as tuples stored in a dataspace (as the tuple space is usually called in Swarm) and the computation consists of a swarm of atomic transactions on the dataspace. A transaction is defined by a rewriting rule and it ....

[Article contains additional citation context not shown here]

G. C. Roman and H. C. Cunningam. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(2):1361--1376, 1990.

....paradigm. We have defined the Swarm programming notation and specified a formal operational model based on a state transition approach [7, 20] Our research is exploring the implications of the shared dataspace approach and the Swarm model for algorithm development and programming methodology [21]. To facilitate formal verification of Swarm programs, we have developed an assertional programming logic and are devising proof techniques appropriate for the dynamic structure of Swarm [7, 22] In a related e#ort, we are investigating the use of the shared dataspace model as a basis for a new ....

G.-C. Roman and H. C. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. Technical Report WUCS--90--1, Washington University, Department of Computer Science, St. Louis, Missouri, February 1990. To appear in IEEE Transactions on Software Engineering.

....program satisfying some additional desired properties is produced. In some of the work on action systems [1] for instance, sequential programs are transformed into concurrent or distributed ones. Mixed specification and program refinement [22, 20] has been used in conjunction with the Swarm model [18] and its proof logic [3, 19] In this paper we pose a simple question. Is it feasible to apply formal derivation techniques to the development of mobile applications Mobile systems, in general, consist of components that may move in a physical or logical space. If the components that move are ....

G.-C. Roman and H. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Trans. on Soft. Eng., 16(12):1361--1373, 1990.

....are placed in a stand by state until needed. This could have some negative implications on verification and, if not considered carefully, could interfere with the fairness assumption which are at the foundation of the proof logic. Another option involves building upon the experience with Swarm [91, 31], a version of UNITY in which both data and statements are dynamically created and destroyed. The prospect of making changes to Mobile UNITY may also force us to re examine the issue of what is an appropriate unit of mobility. So far we selected the program to play this role but a finer grained ....

Roman, G.-C., and Cunningham, H. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Trans. on Software Engineering 16, 12 (Dec. 1990), 1361--1373.

....an action involving a single process defines a computation, while one involving multiple processes represents a communication. Although actions can not execute if disabled, there is no blocking in the sense of waiting for some other party to be ready. The UNITY model [3] and the Swarm model [13] go one step further; an assignment statement or transaction, respectively, is executed merely because it exists. The underlying semantics are those of a state transition system. The distinction between communication and computation is a matter of interpretation. The sequential process concept and ....

....state continue to exist throughout the execution of the program. Finally, we must note that the weak fairness assumption of UNITY is preserved by this representation as long as we do not consider UNITY programs with an unbounded number of single assignment statements. Dynamic synchrony. Swarm [13] is a model of concurrent computation which reduces both computation and communication to atomic transformations of a set of tuple like entities called the dataspace. The dataspace contains data tuples, transactions, and coupling relation entries. Transactions are executed atomically and may ....

Roman, G.-C., and Cunningham, H. C., Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency, IEEE Transactions on Software Engineering 16(12), pp. 1361-1373 (1990).

....program satisfying some additional desired properties is produced. In some of the work on action systems [1] for instance, sequential programs are transformed into concurrent or distributed ones. Mixed specification and program refinement [22, 20] has been used in conjunction with the Swarm model [18] and its proof logic [3, 19] In this paper we pose a simple question. Is it feasible to apply formal derivation techniques to the development of mobile applications Mobile systems, in general, consist of components that may move in a physical or logical space. If the components that move are ....

G.-C. Roman and H. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Trans. on Soft. Eng., 16(12):1361--1373, 1990.

....program satisfying some additional desired properties is produced. In some of the work on action systems [1] for instance, sequential programs are transformed into concurrent or distributed ones. Mixed specification and program refinement [22, 20] has been used in conjunction with the Swarm model [18] and its proof logic [3, 19] In this paper we pose a simple question. Is it feasible to apply formal derivation techniques to the development of mobile applications Mobile systems, in general, consist of components that may move in a physical or logical space. If the components that move are ....

G.-C. Roman and H. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Trans. on Soft. Eng., 16(12):1361--1373, 1990.

....Computer Systems at Washington University, whose primary sponsors are McDonnell Douglas Corporation and Southwestern Bell Corporation. impose sequential dependencies that could undermine parallel implementations. The program notation and proof logic used in this paper are those of Swarm [12], a concurrency model in which all the entities that make up the program state have a tuple like representation and state transitions, called transactions, are described using a rule like notation. The remainder of the paper consists of four main parts followed by conclusions. Section 2 introduces ....

....were executed on available parallel production system models, such as those proposed by Ishida and Stolfo [8] and Schmolze [14] Section 5 presents a systematic formal derivation of a highly concurrent version of this program without reliance on traditional conflict resolution. 2. Notation Swarm [12] belongs to a class of languages and models that use tuple based communication. Other languages and models in this class are Linda [3] Associons [11] and GAMMA [2] In this section we review briefly the Swarm notation and its relation to traditional rule based programming notation. The ....

G.-C. Roman and H. C. Cunningham, "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering, 16, No. 12,. pp 1361-1373 (1990).

....architecture of the simulator is unconventional. It combines a synchronous multicomputer with an asynchronous one, uses partitioned memory, and provides bus based communication. The computational model used to represent the simulator software is a shared dataspace model of concurrency called Swarm [11] a model which, unlike UNITY, allows for dynamic creation of data entities and statements and includes facilities for specifying complex mixes of synchronous and asynchronous computations. Re coding the algorithms stated in Swarm to conform to the language available on the target system is of ....

Roman, G.-C., and Cunningham, H. C., "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1361-1373, 1990.

....and outlines its correctness proof. Section 4 revisits the solution and distributes it across the processors of a SIMD machine. The simulation of the resulting algorithm and architecture on a hypercube are also discussed. A brief summary and conclusions are given in Section 5. 2. Swarm Swarm [20] belongs to a class of languages and models that use tuple based communication and is the first of its kind to have an assertional style proof logic [9, 10] Other languages and models in this class are Linda [6] Associons [19] GAMMA [4] Of particular import for this paper is the ease with ....

Roman, G.-C., and Cunningham, H. C., "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering 16(12), pp. 1361-1373 (1990).

....are placed in a stand by state until needed. This could have some negative implications on verification and, if not considered carefully, could interfere with the fairness assumption which are at the foundation of the proof logic. Another option involves building upon the experience with Swarm [17, 6], a version of UNITY in which both data and statements are dynamically created and destroyed. The prospect of making changes to Mobile UNITY may also force us to re examine the issue of what is an appropriate unit of mobility. So far we selected the program to play this role but a finer grained ....

G.-C. Roman and H.C. Cunningham. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(12):1361--1373, December 1990.

....are placed in a stand by state until needed. This could have some negative implications on verification and, if not considered carefully, could interfere with the fairness assumption which are at the foundation of the proof logic. Another option involves building upon the experience with Swarm [27, 8], a version of UNITY in which both data and statements are dynamically created and destroyed. The prospect of making changes to Mobile UNITY may also force us to re examine the issue of what is an appropriate unit of mobility. So far we selected the program to play this role but a finer grained ....

G.-C. Roman and H.C. Cunningham. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Trans. on Software Engineering, 16(12):1361--1373, Dec. 1990.

....computations. Several design requirements played an important role in shaping the conceptional model on which Pavane is based. 1) A broad class of concurrent computations had to be specifiable in a language that has an associated assertional style proof logic. Pavane uses the language Swarm [9], a computational model which extends UNITY [2] and its proof logic to include content based accessing to data, dynamic statements, and dynamic partial synchrony. Swarm is particularly attractive due to its simple and uniform representation of both data and control states: a single set of tuples ....

....explain how it is expressed in Swarm. Since the focus of this paper is the specification of visualizations, not computations, we explain Swarm and its notation only to the extent necessary to support the remainder of the presentation. The reference list, however, cites articles that discuss Swarm [9] and its proof logic [3] Underlying the Swarm language is a state transition model similar to that of UNITY [2] In Swarm, the state of a computation is represented by the contents of the dataspace, a set of contentaddressable entities. The model partitions the dataspace into three subsets: the ....

Roman, G.-C. and Cunningham, H.C., "Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency," IEEE Transactions on Software Engineering Vol. 16, No. 12, pp 13611373 (Dec 1990).

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