> "the lock duration is strictly bounded; it is determined by the application or... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		md5person on Oct 30, 2020 \| parent \| context \| favorite \| on: Ruby's Proposed STM > "the lock duration is strictly bounded; it is determined by the application or the thread-scheduler" Practically speaking - wouldn't the exact duration be heavily influenced by the countless layers of abstraction beneath the application itself (kernel, scheduler, hardware, speculative execution, etc)? If so, can we ever truly make the claim that the "duration is strictly bounded"?

chrisseaton on Oct 30, 2020 [–]

In terms of the level at which we reason about thread interleavings, which is what we’re talking about, it is bound.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact