Abstract
A system of asynchronous parallel processes is represented by an exclusion graph in which a vertex is a process and an edge is a pair of mutually excluding processes. The mutual exclusion problem can be managed by simple entrance and exit protocols using PVchunk operations on a single shared variable when the graph is a threshold one. Ordman wonders if an efficient way exists for managing mutual exclusion situations modeled by more complex graphs than the threshold ones. A start is made on that here: we present a solution of the problem when the model is in the class of matrogenic graphs, which properly contains the threshold graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.