Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
aidenn0
on Dec 17, 2014
|
parent
|
context
|
favorite
| on:
Linus Torvalds on semaphores (1999)
In practice, the semaphores available for many systems are considerably slower than using architecture provided atomic increment operations, which means implementing a bounded buffer with two counters and two mutexes ends up being faster.
Consider applying for YC's Fall 2026 batch!
Applications
are open till July 27.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: