Cameo: an alternative model of concurrency for Eiffel

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

doi:10.1007/s00165-008-0096-1

Cameo: an alternative model of concurrency for Eiffel

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

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	363-391
Journal	Formal Aspects of Computing
Volume	21
Issue number	4
DOIs	https://doi.org/10.1007/s00165-008-0096-1
Publication status	Published - 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.

Access to Document

10.1007/s00165-008-0096-1

Cite this

@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 = "Association for Computing Machinery (ACM)",

number = "4",

}

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

SN - 1433-299X

VL - 21

SP - 363

EP - 391

JO - Formal Aspects of Computing

JF - Formal Aspects of Computing

IS - 4

ER -

Cameo: an alternative model of concurrency for Eiffel

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this