Jingle Bells: Solving the Santa Claus Problem in Polyphonic C# by Nick Benton.
This paper presents the solution to the Santa Claus problem in the Polyphonic C# language. Polyphonic C# is an extension of Microsoft's C# language with concurrency primitives based on those of the join calculus. It was intended for use in "orchestrating distributed applications built on asynchronous messaging," but is "equally applicable to programming with multiple threads in a shared-memory environment."
This is, the authors claim, another piece of evidence supporting the claim that the join calculus is an effective basis for concurrent, as well as distributed, programming.
Google | Del.icio.us | CiteULike | LtU
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment