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.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | On PVchunk operations and matrogenic graphs | |
Autori: | ||
Data di pubblicazione: | 1992 | |
Rivista: | ||
Handle: | http://hdl.handle.net/11573/30385 | |
Appartiene alla tipologia: | 01a Articolo in rivista |