Avoiding Register Overflow in the Bakery Algorithm

@article{Abdi2020AvoidingRO,
  title={Avoiding Register Overflow in the Bakery Algorithm},
  author={A. Abdi and M. Sharifi},
  journal={49th International Conference on Parallel Processing - ICPP : Workshops},
  year={2020}
}
  • A. Abdi, M. Sharifi
  • Published 2020
  • Computer Science
  • 49th International Conference on Parallel Processing - ICPP : Workshops
Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users’ requirements. This scheme may implement certain policies such as “never allocate more than X units of resource Z”. One policy that is of particular interest is the inability of users to access a single resource at the same time, which is called the problem of mutual exclusion. Resource management… Expand

References

SHOWING 1-3 OF 3 REFERENCES
Highly-fair bakery algorithm using symmetric tokens
Solution of a problem in concurrent programming control
A New Solution of Dijkstra ' s Concurrent Programming Problem