Content deleted Content added
corrected typo |
change paradigms template to navbox (see Template talk:Programming paradigms#too long) |
||
(13 intermediate revisions by 12 users not shown) | |||
Line 1:
{{multiple issues|
{{Programming paradigms}}▼
{{Refimprove|date=May 2011}}
{{Notability|date=May 2011}}
}}
'''Relativistic programming''' ('''RP''') is a style of [[concurrent programming]] where instead of trying to avoid conflicts between readers and writers (or writers and writers in some cases) the algorithm is designed to tolerate them and get a correct result regardless of the order of events. Also, relativistic programming algorithms are designed to work without the presences of a global order of events. That is,
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]] (
== See also ==
* [[Non-blocking algorithm]]
== References ==
Line 13 ⟶ 17:
* [http://wiki.cs.pdx.edu/rp/ Relativistic Programming] at [[Portland State University]]
▲{{Programming paradigms navbox}}
{{comp-sci-stub}}▼
[[Category:Concurrent computing]]
▲{{comp-sci-stub}}
|