Abstract
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair treatment of processes by the scheduler. We define weak and strong fairness for the Small Chorded Object-Oriented Language (lSCHOOL) which allows the classification of executions as fair. We investigate the liveness behaviour of programs and establish worst-case behaviours in terms of scheduling delays.
We discover that weak fairness, although giving the scheduler implementer greater freedom in selecting the next process which is to be executed, is harder to implement than strong fairness; strong fairness benefits from a straightforward implementation, however, imposes many more constraints and limits the selection function of a scheduler.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fournet, C., Gonthier, G.: The reflexive CHAM and the join-calculus. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, United States, pp. 372–385. ACM Press, New York (1996)
Fournet, C., Gonthier, G.: The join calculus: a language for distributed mobile programming, pp. 1–66. Applied Semantics Summer School (2008)
Chrysanthakopoulos, G., Singh, S.: An asynchronous messaging library for C\({}^{\sharp}\). In: Synchronization and Concurrency in Object-Oriented Languages (SCOOL) Workshop, OOPSLA (October 2005)
Russo, C.: Join patterns for visual basic. In: OOPSLA (2008)
Russo, C.: The joins concurrency library. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 260–274. Springer, Heidelberg (2006)
Benton, N., Bierman, G., Cardelli, L., Meijer, E., Russo, C., Schulte, W.: C ω (2004), http://research.microsoft.com/Comega/
Fournet, C.: The jocaml language (2008), http://jocaml.inria.fr/
Cremet, V.: Join definitions in scala, http://lamp.epfl.ch/~cremet/join_in_scala/
Benton, N., Cardelli, L., Fournet, C.: Modern concurrency abstractions for C\({}^{\sharp}\). In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 415–440. Springer, Heidelberg (2002)
Costa, G., Stirling, C.: Weak and strong fairness in ccs. Information and Computation 73(3), 207–244 (1987)
Kwiatkowska, M.Z.: Survey of fairness notions. Information and Software Technology 31(7), 371–386 (1989)
Francez, N.: Fairness. ACM Press, New York (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Petrounias, A., Eisenbach, S. (2009). Fairness for Chorded Languages. In: Field, J., Vasconcelos, V.T. (eds) Coordination Models and Languages. COORDINATION 2009. Lecture Notes in Computer Science, vol 5521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02053-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-02053-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02052-0
Online ISBN: 978-3-642-02053-7
eBook Packages: Computer ScienceComputer Science (R0)