We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could bo issued by threads running at each node. Our algorithm relies on special-purpose alien threads running at host processors on behalf of threads running at other processors. The algorithm uses a tree to route requests for the token. We present a. performance simulation study comparing two versions of our algorithm with a known algorithm based on path reversal on trees. Results show that our algorithm performs very well under a high load of requests while obtaining acceptable performance under a light load. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Federico, M., Jorge Pérez, R., & Yadran, E. (2005). Implementing distributed mutual exclusion on multithreaded environments: The alien-threads approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3563 LNCS, pp. 51–62). https://doi.org/10.1007/11533962_6
Mendeley helps you to discover research relevant for your work.