Fairness for Chorded Languages

  • Alexis Petrounias
  • Susan Eisenbach
Conference paper

DOI: 10.1007/978-3-642-02053-7_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5521)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Alexis Petrounias
    • 1
  • Susan Eisenbach
    • 1
  1. 1.Department of ComputingImperial College LondonUnited Kingdom

Personalised recommendations