Subj : Re: Implementing lock-free data structures
To   : comp.programming.threads
From : SenderX
Date : Thu Mar 10 2005 01:24 pm

> I don't feel like publishing the general rules at this point because it
> would basically be a guide for patenting all the lock-free implementations
> no one has gotten around to yet.  Because the US patent office *will*
> issue patents for them.  Sun already has a patent on lock-free ilnked
> list used with one form of GC.

Yeah. I too am "sort of thinking" about protecting one of my proxy gc's ( 
not published anywhere ) that can chew on extremely high amounts of 
concurrent writes without running the risk of draining all the system 
resources. All of my other collectors blow the stack in C++, or just plain 
run out of memory in C when a couple of million writes rapidly and 
repeatedly come in from 10 or so threads over extended periods of time. How 
could I effectively protect my new collector without getting a patent?

.