Relativistic programming: Difference between revisions

Revision as of 13:34, 8 December 2011

Revision as of 21:17, 6 February 2012

Line 6:

Relativistic programming provides advantages in performance compared to other concurrency paradigms because it does not require one thread to wait for another nearly as often. Because of this, forms of it ([[Read-Copy-Update]] for instance) are now used extensively in the [[Linux kernel]] (more than 5,000 times {{as of|2011|lc=on}}).<ref>http://www.rdrop.com/users/paulmck/RCU/linuxusage.html</ref>

== See also ==

* [[Non-blocking algorithm]]

== References ==