Relativistic programming: Difference between revisions

Revision as of 01:41, 24 May 2011

Revision as of 03:44, 24 May 2011

Line 1:

{{Programming paradigms}}

{{comp-sci-stub}}

[[Relativistic programming]] (also called 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 in some there maybe cases where one thread sees a two events in a different order then another thread (hence the term relativistic because in [[Special relativity|Einstein's relativity]] order of events is not always the same to different viewers).

Relativistic programming provides advantages in performance compared to other concurrecy 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]] <ref>RCU is used more than 5000 times in the Linux kernel as of 2011. [http://www.rdrop.com/users/paulmck/RCU/linuxusage.html]</ref>

== References ==

{{Reflist}}

== External links ==

* [http://wiki.cs.pdx.edu/rp/ Relativistic Programming At Portland State University]

{{comp-sci-stub}}

== Notes ==

{{Reflist}}

[[Category:Concurrent computing]]