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

    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.

    Fingerprint Dive into the research topics of 'Cameo: an alternative model of concurrency for Eiffel'. Together they form a unique fingerprint.

  • Cite this