Cameo: an alternative model of concurrency for Eiffel

P. J. (Phillip) Brooke, R. F. (Richard) Paige

    Research output: Contribution to journalArticle

    Abstract

    The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.
    Original languageEnglish
    Pages (from-to)363-391
    JournalFormal Aspects of Computing
    Volume21
    Issue number4
    DOIs
    Publication statusPublished - 2013

    Fingerprint

    Concurrency
    Alternatives
    Model
    Computer programming languages
    Exception
    Parallelism
    Programming Languages
    Semantics

    Bibliographical note

    The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

    Cite this

    Brooke, P. J. (Phillip) ; Paige, R. F. (Richard). / Cameo: an alternative model of concurrency for Eiffel. In: Formal Aspects of Computing. 2013 ; Vol. 21, No. 4. pp. 363-391.
    @article{57fd6ce9d03b4c43b53a11c5ac7dd5cc,
    title = "Cameo: an alternative model of concurrency for Eiffel",
    abstract = "The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.",
    author = "Brooke, {P. J. (Phillip)} and Paige, {R. F. (Richard)}",
    note = "The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.",
    year = "2013",
    doi = "10.1007/s00165-008-0096-1",
    language = "English",
    volume = "21",
    pages = "363--391",
    journal = "Formal Aspects of Computing",
    issn = "1433-299X",
    publisher = "Springer Verlag",
    number = "4",

    }

    Cameo: an alternative model of concurrency for Eiffel. / Brooke, P. J. (Phillip); Paige, R. F. (Richard).

    In: Formal Aspects of Computing, Vol. 21, No. 4, 2013, p. 363-391.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Cameo: an alternative model of concurrency for Eiffel

    AU - Brooke, P. J. (Phillip)

    AU - Paige, R. F. (Richard)

    N1 - The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

    PY - 2013

    Y1 - 2013

    N2 - The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

    AB - The authors present a new concurrency model for the Eiffel programming language. The model is motivated by describing a number of semantic problems with the leading concurrency model for Eiffel, namely SCOOP. Our alternative model aims to preserve the existing behaviour of sequential programs and libraries wherever possible. Comparison with the SCOOP model is made. The concurrency aspects of the alternative model are presented in CSP along with a model of exceptions. The results show that while the new model provides increased parallelism, this comes with the price of increased overhead due to lock management.

    U2 - 10.1007/s00165-008-0096-1

    DO - 10.1007/s00165-008-0096-1

    M3 - Article

    VL - 21

    SP - 363

    EP - 391

    JO - Formal Aspects of Computing

    JF - Formal Aspects of Computing

    SN - 1433-299X

    IS - 4

    ER -