Neil and others, It might be interesting to look at some of the papers by Michael Scott et al. I am not an expert on non-blocking data structures, but the following page seems interesting:
http://www.cs.rochester.edu/u/scott/synchronization/ esp. "(7) nonblocking "dual" data structures, which combine lock freedom with condition synchronization; and (8) contention management for software transactional memory" In any case, I think only when contention is high the non-blocking algorithms are worth looking at. So can someone shine some light on where the contention might be? Cheers! -Min On Tue, 25 Jan 2005 Neil Conway wrote : > On Mon, 2005-01-24 at 16:50 -0700, Jonah H. Harris wrote: > > Here is some pretty good info on lock-free structures... I'm pretty sure > > I tested their code in a multithreaded high-concurrency environment and > > experienced the problems I was discussing. > > Fair enough, but my hope would be that those problems were the result of > bugs in the implementation rather than some fundamental property of > lock-free data structures. A concurrency control mechanism that falls > over under concurrent access sounds a little broken, no? > > -Neil > > > > ---------------------------(end of broadcast)--------------------------- > TIP 3: if posting/reading through Usenet, please send an appropriate > subscribe-nomail command to [EMAIL PROTECTED] so that your > message can get through to the mailing list cleanly ---------------------------(end of broadcast)--------------------------- TIP 6: Have you searched our list archives? http://archives.postgresql.org
