Event Synchronization by Lightweight Message Passing
| dc.creator | Chaudhuri, Avik | |
| dc.date | 2008-05-27 | |
| dc.date.accessioned | 2026-07-07T09:41:04Z | |
| dc.date.available | 2026-07-07T09:41:04Z | |
| dc.description | Concurrent ML's events and event combinators facilitate modular concurrent programming with first-class synchronization abstractions. A standard implementation of these abstractions relies on fairly complex manipulations of first-class continuations in the underlying language. In this paper, we present a lightweight implementation of these abstractions in Concurrent Haskell, a language that already provides first-order message passing. At the heart of our implementation is a new distributed synchronization protocol. In contrast with several previous translations of event abstractions in concurrent languages, we remain faithful to the standard semantics for events and event combinators; for example, we retain the symmetry of $\mathtt{choose}$ for expressing selective communication. | |
| dc.identifier | https://arxiv.org/abs/0805.4029 | |
| dc.identifier | http://arxiv.org/abs/0805.4029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161700 | |
| dc.subject | Programming Languages | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | D.3.3; D.1.3; F.3.3 | |
| dc.title | Event Synchronization by Lightweight Message Passing | |
| dc.type | text |