Event Synchronization by Lightweight Message Passing

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Event Synchronization by Lightweight Message Passing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Event Synchronization by Lightweight Message Passing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Event Synchronization by Lightweight Message Passing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-272592

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.