%0 Conference Proceedings
%T Safe and Efficient Data Sharing for Message-Passing Concurrency
%+ Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology  [Zürich] (ETH Zürich)
%A Morandi, Benjamin
%A Nanz, Sebastian
%A Meyer, Bertrand
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th International Conference on Coordination Models and Languages (COORDINATION)
%C Berlin, Germany
%Y David Hutchison
%Y Takeo Kanade
%Y Bernhard Steffen
%Y Demetri Terzopoulos
%Y Doug Tygar
%Y Gerhard Weikum
%Y Eva Kühn
%Y Rosario Pugliese
%Y Josef Kittler
%Y Jon M. Kleinberg
%Y Alfred Kobsa
%Y Friedemann Mattern
%Y John C. Mitchell
%Y Moni Naor
%Y Oscar Nierstrasz
%Y C. Pandu Rangan
%I Springer
%3 Coordination Models and Languages
%V LNCS-8459
%P 99-114
%8 2014-06-03
%D 2014
%R 10.1007/978-3-662-43376-8_7
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Message passing provides a powerful communication abstraction in both distributed and shared memory environments. It is particularly successful at preventing problems arising from shared state, such as data races, as it avoids sharing in general. Message passing is less effective when concurrent access to large amounts of data is needed, as the overhead of messaging may be prohibitive. In shared memory environments, this issue could be alleviated by supporting direct access to shared data; but then ensuring proper synchronization becomes again the dominant problem. This paper proposes a safe and efficient approach to data sharing in message-passing concurrency models based on the idea of distinguishing active and passive computational units. Passive units do not have execution capabilities but offer to active units exclusive and direct access to the data they encapsulate. The access is transparent due to a single primitive for both data access and message passing. By distinguishing active and passive units, no additional infrastructure for shared data is necessary. The concept is applied to SCOOP, an object-oriented concurrency model, where it reduces execution time by several orders of magnitude on data-intensive parallel programs.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01290070/document
%2 https://inria.hal.science/hal-01290070/file/326181_1_En_7_Chapter.pdf
%L hal-01290070
%U https://inria.hal.science/hal-01290070
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-LNCS-8459