Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #3876
| From | aminer <aminer@toto.net> |
|---|---|
| Newsgroups | comp.programming |
| Subject | Re: About Lockfree also... |
| Date | 2013-10-07 21:11 -0700 |
| Organization | albasani.net |
| Message-ID | <l2vm38$7e3$2@news.albasani.net> (permalink) |
| References | <l2vket$59t$2@news.albasani.net> |
On 10/7/2013 8:43 PM, aminer wrote:> when there is contention, in worst scenarios you can > have 1+2+3+4+ ..N = ((N^2+N)/2) or even worse N+N+N+N...N = N^2 In worst case scenarios it can be much much worst than that, i have took just an example to show that lockfree FIFO queue algorithms are very bad when there is contention. Amine Moulay Ramdane.
Back to comp.programming | Previous | Next — Previous in thread | Find similar | Unroll thread
About Lockfree also... aminer <aminer@toto.net> - 2013-10-07 20:43 -0700 Re: About Lockfree also... aminer <aminer@toto.net> - 2013-10-07 21:11 -0700
csiph-web