| |||||||||||||
livelock?livelock?Posted Jan 30, 2003 20:07 UTC (Thu) by cpeterso (guest, #305)Parent article: Fast reader/writer locks I could imagine a livelock problem that would not exist using regular spinlocks. A reader could (theoretically) spin forever if writers keep updating the data. The reader would keep looping, trying to get the most up to date version of the data. If the reader used spinlocks, it would get its turn to read (and then the data would be overwritten and outdated by the many writers).
(Log in to post comments)
livelock? Posted Jan 30, 2003 20:49 UTC (Thu) by hensema (guest, #980) [Link] Theoretically possible, yes. But this kind of lock is really just meant to be used in situations where relatively little writes are happening. Livelock is thus avoided by programming practice and not by design.
|
|||||||||||||