A small calculus for concurrent objects

Honda, Kohei; Tokoro, Mario

doi:10.1145/127070.127079

Cited by 13 publications

(2 citation statements)

References 7 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, the receiver ,assimilates the messenger into itself. The similar fi'amework is used for a formalization of inter-object message-I)assing in [5].…”

Section: Computational Field Modelmentioning

confidence: 99%

An adaptive load balancing method in the computational field model

Uehara¹,

Tokoro²

1991

SIGPLAN OOPS Mess.

Self Cite

View full text Add to dashboard Cite

Computational Field Model(CFM) was proposed as a computationM model for open ended distributed environmcnts. It. encal)sulates an open ended distributed environment as a metric space called computational field(CF).In this paper, we propose an optimM object allocation algorithm on CFM, which combines both dynamic object groul)ing and adaptive load balancing. Furthermore, we discuss the cost of this algorithm and its adaptability.

show abstract

“…Finally, the receiver ,assimilates the messenger into itself. The similar fi'amework is used for a formalization of inter-object message-I)assing in [5].…”

Section: Computational Field Modelmentioning

confidence: 99%

An adaptive load balancing method in the computational field model

Uehara¹,

Tokoro²

1991

SIGPLAN OOPS Mess.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The locality property of channels is achieved by imposing that only the output capability of names may be transmitted, i.e., the recipient of a name may only use it in output actions. Lπ is a very expressive fragment of asynchronous π-calculus, and its theory has been studied in [15]; similar calculi are discussed, or at least mentioned, in [12,4,1,30]. Lπ borrows ideas from some experimental programming languages (or proposals of programming languages), most notably Pict [20], Join [8], and Blue [6], and can be regarded as a basis for them (the restriction on output capabilities is not explicit in Pict, but, as we understand from the Pict users, most Pict programs obey it).…”

Section: Introductionmentioning

confidence: 99%

Locality and Polyadicity in Asynchronous Name-Passing Calculi

Merro

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We give a divergence-free encoding of polyadic Local π into its monadic variant. Local π is a sub-calculus of asynchronous π-calculus where the recipients of a channel are local to the process that has created the channel. We prove the encoding fully-abstract with respect to barbed congruence. This implies that in Local π (i) polyadicity does not add extra expressive power, and (ii) when studying the theory of polyadic Local π we can focus on the simpler monadic variant. Then, we show how the idea of our encoding can be adapted to name-passing calculi with non-binding input prefix, such as Chi, Fusion and πF calculi .

show abstract

Assigning Types to Processes

Yoshida

Hennessy

2002

Information and Computation

View full text Add to dashboard Cite

In wide area distributed systems it is now common for higher-order code to be transferred from one domain to another; the receiving host may initialise parameters and then execute the code in its local environment. In this paper we propose a fine-grained typing system for a higher-order πcalculus which can be used to control the effect of such migrating code on local environments. Processes may be assigned different types depending on their intended use. This is in contrast to most of the previous work on typing processes where all processes are typed by a unique constant type, indicating essentially that they are well-typed relative to a particular environment.Our process type takes a form of an interface limiting the resources to which it has access, and the types at which they may be used. Allowing resource names to appear both in process types and process terms, as interaction ports, complicates the typing system considerably. For the development of a coherent typing system, we use a kinding technique, similar to that used by the subtyping of the system F, and order-theoretic properties of our subtyping relation.Various examples of this paper illustrate the use of our fine-grained typing system for distributed systems. As a specific application we define a new typed behavioural equivalence for the higher-order π-calculus. The expressiveness of our types enables us to state and prove interesting identities between typed processes.

show abstract

A small calculus for concurrent objects

Cited by 13 publications

References 7 publications

An adaptive load balancing method in the computational field model

An adaptive load balancing method in the computational field model

Locality and Polyadicity in Asynchronous Name-Passing Calculi

Assigning Types to Processes

Contact Info

Product

Resources

About