Semaphores
Semaphores is a synchronization construct used in concurrent programming to control access to shared resources by multiple threads or processes, distinguishing itself through the use of a non-negative integer value manipulated via atomic operations to indicate availability or contention.
64
Publications
5.4K
Citations
159
Authors
69
Institutions
Publications per year
2017–2026
3
64
C. A. R. Hoare · Communications of the ACM · 1974 · 1.5K citations · Full text
A stack-based resource allocation policy for realtime processes
T. P. Baker · 1990 · 289 citations
1–5 of 64
159
Rutgers, The State University of New Jersey, United States
3 publications · 144 citations
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 159
69

Washington University in St. Louis
St Louis, United States
3 h-index
8 publications
368 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
1.4K citations
University of Michigan
Ann Arbor, United States
3 h-index
8 publications
169 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
429 citations

Johns Hopkins University
Baltimore, United States
2 h-index
2 publications
87 citations
Brown University
Providence, United States
2 h-index
5 publications
64 citations
Seoul National University
Seoul, South Korea
2 h-index
5 publications
133 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
74 citations
1–8 of 69
3 publications · 1.5K citations
3
h-index
2 publications · 41 citations
2
h-index
2 publications · 24 citations
2
h-index
BBRC · 2 publications · 64 citations
2
h-index
JCI · 2 publications · 91 citations
2
h-index
1–5