| Wisdom90 <d@d.d>: Oct 16 01:29PM -0400 On 10/16/2019 7:48 AM, Bonita Montero wrote: > in locked mode in very rare cases. And as I said inserting and > flushing is conventional locked access. > So the quest is for you: Can you guess what I did? I think i am also smart, so i have just quickly found a solution that is scalable and that is not your solution, so it needs my hashtable that scales very well and it needs my fully scalable FIFO queue that i have invented. But i will not patent it, because i will let you patent yours since i have seen you speaking on the newsgroup of C++ about it. But my solution is not Lockfree, it uses locks and it is scalable. Thank you, Amine Moulay Ramdane. |
| Bonita Montero <Bonita.Montero@gmail.com>: Oct 16 08:14PM +0200 > I think i am also smart, so i have just quickly found a solution that is > scalable and that is not your solution, so it needs my hashtable that > scales very ... A scaling hashtable is easy. > ... scales very well and it needs my fully scalable FIFO queue that > i have invented. That's also easy. > But i will not patent it, .. There's prior art for both. As someone else told you: your ideas aren't new. > because i will let you patent yours since i have seen you speaking on > the newsgroup of C++ about it. I'd have no problem if you show my idea as prior art. So go on. > But my solution is not Lockfree, it uses locks and it is scalable. A locking LRU-list is never scalable. |
| Wisdom90 <d@d.d>: Oct 16 02:19PM -0400 On 10/16/2019 2:14 PM, Bonita Montero wrote: > So go on. >> But my solution is not Lockfree, it uses locks and it is scalable. > A locking LRU-list is never scalable. On 10/16/2019 1:33 PM, Wisdom90 wrote: > Thank you, > Amine Moulay Ramdane. > A locking LRU-list is never scalable. I said it uses locks and it is scalable, because locks are distributed like when you does lock striping. So there is no logical contradiction in my writing. Thank you, Amine Moulay Ramdane. |
| Wisdom90 <d@d.d>: Oct 16 02:20PM -0400 On 10/16/2019 2:14 PM, Bonita Montero wrote: > So go on. >> But my solution is not Lockfree, it uses locks and it is scalable. > A locking LRU-list is never scalable. I correct: I said it uses locks and it is scalable, because locks are distributed like when you do lock striping. So there is no logical contradiction in my writing. Thank you, Amine Moulay Ramdane. |
| Bonita Montero <Bonita.Montero@gmail.com>: Oct 17 05:07AM +0200 > I said it uses locks and it is scalable, because locks are distributed > like when you does lock striping. So there is no logical contradiction > in my writing. Striped locks are nothing new with hashtables. Java has ConcurrehtHashMap<K, V>. |
| aminer68@gmail.com: Oct 16 12:31PM -0700 Hello, Here is my new poem of Love: I was just listening to the following beautiful song: https://www.youtube.com/watch?v=nqAvFx3NxUM So i have just decided to write fast a poem of Love, here it is: Look at the way we were like beautifully flying in the air Since we are like angels of God that are really aware Look at the way we were like beautifully flying in the air Since our love is like a beautiful light coming from everywhere Look at the way we were like beautifully flying in the air Since our love is not the despair but it is a multimillionaire winner Look at the way we were like beautifully flying in the air Since our love is like our beautiful shield that really care Look at the way we were like beautifully flying in the air So is our love our "beautiful" everyday prayer ! Look at the way we were like beautifully flying in the air Since i am even seeing the light of love in your beautiful hairs ! Look at the way we were like beautifully flying in the air So come to me beautiful since our love is really for "forever" ! Thank you, Amine Moulay Ramdane. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.programming.threads+unsubscribe@googlegroups.com. |
No comments:
Post a Comment