Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming > #3501 > unrolled thread
| Started by | "Chris M. Thomasson" <no@spam.invalid> |
|---|---|
| First post | 2013-06-20 22:11 -0700 |
| Last post | 2013-06-20 22:11 -0700 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.programming
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Lockfree algorithms are good for small number of cores "Chris M. Thomasson" <no@spam.invalid> - 2013-06-20 22:11 -0700
| From | "Chris M. Thomasson" <no@spam.invalid> |
|---|---|
| Date | 2013-06-20 22:11 -0700 |
| Subject | Re: Lockfree algorithms are good for small number of cores |
| Message-ID | <kq0n9k$7ts$1@speranza.aioe.org> |
> "aminer" wrote in message news:kq09he$vbk$2@dont-email.me... >Lockfree algorithms are good for small number of cores >up to 16 cores , but they are not good for more cores >than that, cause they higher the contention. You are focusing on wrong areas. For instance, have you ever thought of distributed lock/wait-free algorithms? For instance, even a distributed rwlock based on atomic RMW cannot really even think about beating a RCU like system. Calm down a little bit and ponder the thought Aminer...
Back to top | Article view | comp.programming
csiph-web