Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.programming.threads > #4260

About Lockfree algorithms..

Path csiph.com!eternal-september.org!feeder.eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail
From Sky89 <Sky89@sky68.com>
Newsgroups comp.programming.threads
Subject About Lockfree algorithms..
Date Wed, 9 May 2018 18:14:29 -0400
Organization A noiseless patient Spider
Lines 22
Message-ID <pcvdq5$gn7$2@dont-email.me> (permalink)
Mime-Version 1.0
Content-Type text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding 7bit
Injection-Date Wed, 9 May 2018 18:14:29 -0000 (UTC)
Injection-Info reader02.eternal-september.org; posting-host="e1b35fef6302e6da84f5b3c342d89be8"; logging-data="17127"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18kUTONjN7GY/Pc+x8AsRrT"
User-Agent Mozilla/5.0 (Windows NT 10.0; WOW64; rv:52.0) Gecko/20100101 Thunderbird/52.7.0
Content-Language en-US
X-Mozilla-News-Host news://news.eternal-september.org:119
Cancel-Lock sha1:o2NvIPNTskrVbBjR1mQAJfn4Em0=
Xref csiph.com comp.programming.threads:4260

Show key headers only | View raw


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


Thread

About Lockfree algorithms.. Sky89 <Sky89@sky68.com> - 2018-05-09 18:14 -0400

csiph-web