Jingle Bells: Solving the Santa Claus Problem in Polyphonic C

Abstract

The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple solution to the problem in Polyphonic C , an extension of C with new concurrency constructs based on the Join calculus. 

Topics

Cite this paper

@inproceedings{Benton2003JingleBS, title={Jingle Bells: Solving the Santa Claus Problem in Polyphonic C}, author={Nick Benton}, year={2003} }