An efficient solution to the mutual exclusion problem using unfair and weak semaphore

Authors:
S. Haldar;D. Subramanian
Affiliations:
Department of Computer Science & Automation, Bangalore, India;Department of Computer Science & Automation, Bangalore, India
Venue:
ACM SIGOPS Operating Systems Review
Year:
1988

Citing 3
Cited 1

Absence of individual starvation using weak semaphores

Information Processing Letters
An efficient solution to the mutual exclusion problem using weak semaphores

Information Processing Letters
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)

Fairness in processor scheduling in time sharing systems

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract