Refining Santa: An Exercise in Efficient Synchronization
Emil Sekerinski (McMaster University), Shucai Yao (McMaster, University)
TL;DR
This paper presents a step-by-step refinement process to develop an efficient concurrent implementation of the Santa Claus Problem, emphasizing synchronization and comparing performance across programming languages.
Contribution
It introduces a systematic refinement approach for efficient synchronization in concurrent programming, demonstrated through the Santa Claus Problem.
Findings
The refined implementation outperforms others in efficiency.
Systematic refinement improves synchronization in concurrent systems.
Performance comparisons highlight language-specific advantages.
Abstract
The Santa Claus Problem is an intricate exercise for concurrent programming. This paper outlines the refinement steps to develop a highly efficient implementation with concurrent objects, starting from a simple specification. The efficiency of the implementation is compared to those in other languages.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.