Ricart-agrawala Algorithm
The Ricart-Agrawala Algorithm is a distributed mutual exclusion algorithm that extends Lamport's logical clocks to achieve resource synchronization by requiring each process to obtain permission from all other processes in the system through timestamped request and reply messages, ensuring that only one process enters the critical section at a time.
6
Publications
484
Citations
9
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
6
A distributed mutual exclusion algorithm
I. Suzuki, Tadao Kasami · ACM Transactions on Computer Systems · 1985 · 312 citations · Full text
Distributed algorithms in Java
Mordechai Ben‐Ari · ACM SIGCSE Bulletin · 1997 · 20 citations · Full text
1–5 of 6
9
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 9
8

Weizmann Institute of Science
Rehovot, Israel
2 h-index
2 publications
36 citations
Texas Tech University
Lubbock, United States
1 h-index
1 publications
312 citations
The University of Osaka
Osaka, Japan
1 h-index
1 publications
312 citations
University of Kentucky
Lexington, United States
1 h-index
1 publications
37 citations

Université de Franche-Comté
Besançon, France
1 h-index
2 publications
70 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
37 citations
Synopsys (United States)
Mountain View, United States
1 h-index
1 publications
64 citations
University of Illinois Chicago
Chicago, United States
1 h-index
1 publications
64 citations
1–8 of 8
TPDS · 2 publications · 101 citations
2
h-index
TOCS · 1 publications · 312 citations
1
h-index
1 publications · 20 citations
1
h-index
1–3