How to solve the Santa Claus problem

@article{BenAri1998HowTS,
  title={How to solve the Santa Claus problem},
  author={Mordechai Ben-Ari},
  journal={Concurrency - Practice and Experience},
  year={1998},
  volume={10},
  pages={485-496}
}
John Trono published a new exercise in concurrent programming—the Santa Claus problem—and provided a solution based on semaphores [12]. His solution is incorrect because it assumes that a process released from waiting on a semaphore will necessarily be scheduled for execution. We give a simple solution in Ada 95 using higher order synchronization primitives: protected objects and rendezvous. We then give solution in Java, though this solution is not as elegant as the Ada 95 solution because the… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Concurrent Programming in Java

D. Lea
  • 1997
VIEW 1 EXCERPT

The Search for Simplicity: Essays in Parallel Programming

P. Brinch Hansen
  • 1996
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…