Safe and Efficient Data Sharing for Message-Passing Concurrency

Abstract : 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.
Type de document :
Communication dans un congrès
David Hutchison; Takeo Kanade; Bernhard Steffen; Demetri Terzopoulos; Doug Tygar; Gerhard Weikum; Eva Kühn; Rosario Pugliese; Josef Kittler; Jon M. Kleinberg; Alfred Kobsa; Friedemann Mattern; John C. Mitchell; Moni Naor; Oscar Nierstrasz; C. Pandu Rangan. 16th International Conference on Coordination Models and Languages (COORDINATION), Jun 2014, Berlin, Germany. Springer, Lecture Notes in Computer Science, LNCS-8459, pp.99-114, 2014, Coordination Models and Languages. 〈10.1007/978-3-662-43376-8_7〉
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01290070
Contributeur : Hal Ifip <>
Soumis le : jeudi 17 mars 2016 - 15:25:42
Dernière modification le : jeudi 12 mai 2016 - 10:48:07
Document(s) archivé(s) le : dimanche 19 juin 2016 - 14:20:59

Fichier

326181_1_En_7_Chapter.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Benjamin Morandi, Sebastian Nanz, Bertrand Meyer. Safe and Efficient Data Sharing for Message-Passing Concurrency. David Hutchison; Takeo Kanade; Bernhard Steffen; Demetri Terzopoulos; Doug Tygar; Gerhard Weikum; Eva Kühn; Rosario Pugliese; Josef Kittler; Jon M. Kleinberg; Alfred Kobsa; Friedemann Mattern; John C. Mitchell; Moni Naor; Oscar Nierstrasz; C. Pandu Rangan. 16th International Conference on Coordination Models and Languages (COORDINATION), Jun 2014, Berlin, Germany. Springer, Lecture Notes in Computer Science, LNCS-8459, pp.99-114, 2014, Coordination Models and Languages. 〈10.1007/978-3-662-43376-8_7〉. 〈hal-01290070〉

Partager

Métriques

Consultations de la notice

33

Téléchargements de fichiers

6