Salucci, Luca and Bonetta, Daniele and Marr, Stefan and Binder, Walter (2016) Generic Messages: Capability-based Shared Memory Parallelism for Event-loop Systems. In: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP Principles and Practice of Parallel Programming . ACM, New York, USA. ISBN 978-1-4503-4092-2. (doi:10.1145/2851141.2851184) (KAR id:63819)
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/137kB) |
![]() |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://doi.org/10.1145/2851141.2851184 |
Abstract
Systems based on event-loops have been popularized by Node.JS, and are becoming a key technology in the domain of cloud computing. Despite their popularity, such systems support only share-nothing parallelism via message passing between parallel entities usually called workers. In this paper, we introduce a novel parallel programming abstraction called Generic Messages (GEMs), which enables shared-memory parallelism for share-nothing event-based systems. A key characteristic of GEMs is that they enable workers to share state by specifying how the state can be accessed once it is shared. We call this aspect of the GEMs model capability-based parallelism.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1145/2851141.2851184 |
Subjects: | Q Science > QA Mathematics (inc Computing science) |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Stefan Marr |
Date Deposited: | 08 Nov 2017 22:07 UTC |
Last Modified: | 09 Dec 2022 03:19 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/63819 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):