Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #4260
| From | Sky89 <Sky89@sky68.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | About Lockfree algorithms.. |
| Date | 2018-05-09 18:14 -0400 |
| Organization | A noiseless patient Spider |
| Message-ID | <pcvdq5$gn7$2@dont-email.me> (permalink) |
Hello, About Lockfree algorithms.. Read the following paper: https://arxiv.org/pdf/1311.3200.pdf It says on the Analysis of the Class SCU(q, s): "Given an algorithm in SCU(q, s) on k correct processes under a uniform stochastic scheduler, the system latency is O(q + s*sqrt(k), and the individual latency is O(k(q + s*sqrt(k))." So i think Lockfree algorithms are very interesting to work with. Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next | Find similar | Unroll thread
About Lockfree algorithms.. Sky89 <Sky89@sky68.com> - 2018-05-09 18:14 -0400
csiph-web