Relativistic programming: Difference between revisions

Revision as of 21:17, 6 February 2012

Revision as of 01:16, 4 November 2013

Line 1:

{{multiple issues|

{{Programming paradigms}}

{{Refimprove|date=May 2011}}

{{Notability|date=May 2011}}

}}

{{Programming paradigms}}

'''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, there may be some cases where one thread sees two events in a different order than another thread (hence the term relativistic because in [[Special relativity|Einstein's theory of special relativity]] the order of events is not always the same to different viewers).

Line 15 ⟶ 17:

== External links ==

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

{{comp-sci-stub}}

[[Category:Concurrent computing]]

{{comp-sci-stub}}