Abstract

This paper is a survey on the synchronization of a system of cooperating processes, when the mutual exclusion graph model and the semaphores are used. Threshold graphs and PVchunk semaphores are explained. Matroidal and matrogenic graphs are presented and their synchronization with a constant number of semaphores for each process are pointed out. Threshold dimension of a graph is explained and a sketched proof of its NP-completeness for k≥3 and of the polynomiality for k=2 is provided.The interest in characterizing new classes of graphs not 2-threshold, but synchronizable with a constant number of semaphores, is shown.KeywordsSynchronization primitivesPVchunk threshold and matrogenic graphs2-threshold dimension

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.