An SR approach to multiway rendezvous

Coffin, Michael H.; Olsson, Ronald A.

doi:10.1016/0096-0551(89)90022-2

Cited by 5 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that interactions in CSP and Ada can involve only two processes. However, more recent language developments (e.g., SCCS [37], CIRCAL [36], Script [19], Compact [15], Action Systems [7], SR [3,16], LOTOS [11], Extended LOTOS [13], IP [17], and DisCo [24,25]) have extended these biparty activities to a more general case, multiparty interactions, allowing an arbitrary number of processes to interact. More precisely, a multiparty interaction is a synchronous action involving a fixed set of participant processes.…”

Section: Introductionmentioning

confidence: 99%

On Fairness Notions in Distributed Systems

Joung

2001

Information and Computation

View full text Add to dashboard Cite

This is the first part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via synchronous constructs-usually called multiparty interactions. In this part we present a criterion for fairness notions and show that if a fairness notion violates the criterion, then no deterministic algorithm for scheduling multiparty interactions can satisfy the fairness notion. Conversely, the implementation is possible if the criterion is obeyed. Thus, the criterion is sufficient and necessary to guarantee the implementability of all possible fairness notions. To our knowledge, this is the first such criterion to appear in the literature. The main benefit of the proposed criterion is that it reduces reasoning about a complex and concrete implementation model to reasoning about a simpler and abstract model for process interaction. To illustrate this, we use the criterion to examine several important fairness notions, including strong interaction fairness, strong process fairness, weak process fairness, U-fairness, and hyperfairness. All, except weak process fairness, fail to pass the criterion. Moreover, we also apply the criterion to analyze the system structures rendering the impossibility phenomena. This analysis helps us separate, for each fairness notion, the set of systems for which the fairness notion can be implemented from those for which it cannot.

show abstract

Section: Introductionmentioning

confidence: 99%

On Fairness Notions in Distributed Systems

Joung

2001

Information and Computation

View full text Add to dashboard Cite

show abstract

“…Two examples are the compact [5] and the script [lo]. An elegant solution for programming special cases of the committee problem exploiting features of the language SR was proposed in [6]. In [5] it is argued that none of the languages CSP, Ada, SR, and Distributed processing provides adequate support for programming the n-party rendezvous.…”

Section: Related Workmentioning

confidence: 99%

Delay-insensitive solutions to the committee problem

Benko

Ebergen²

Proceedings of 1994 IEEE Symposium on Advanced Research in Asynchronous Circuits and Systems

View full text Add to dashboard Cite

The committee problem involves the specification and design of a scheduler for committee meetings. It is a general resource allocation problem that combines both synchronization and mutual exclusion. W e give a simple specification of a scheduler and present three delay-insensitive implementations. Our last implementation contains a high degree of parallelism and is simpler than previously proposed implementations.

show abstract

New mechanisms for invocation handling in concurrent programming languages

Chung

Olsson

1998

Computer Languages

View full text Add to dashboard Cite

An SR approach to multiway rendezvous

Cited by 5 publications

References 7 publications

On Fairness Notions in Distributed Systems

On Fairness Notions in Distributed Systems

Delay-insensitive solutions to the committee problem

New mechanisms for invocation handling in concurrent programming languages

Contact Info

Product

Resources

About