UN NUEVO ALGORITMO DISTRIBUIDO DE EXCLUSIóN MUTUA QUE MINIMIZA EL INTERCAMBIO DE MENSAJES

in this paper we present a new token-based distributed mutual exclusion algorithm. the algorithm relies on two distributed dynamic structures in order to provide mutual exclusion: the "naimi forest" to route token requests, and the "raymond virtual tree" to serve token requests. our strategy combines the best characteristics of two algorithms cited as the most efficient in the literature concerning message traffic. we present a performance simulation study. results show that our algorithm has better performance considering the number of message exchanged per critical section entry.