Relativistic programming

From Wikipedia, the free encyclopedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Relativistic programming" – news · newspapers · books · scholar · JSTOR (May 2011) (Learn how and when to remove this message)

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Relativistic programming" – news · newspapers · books · scholar · JSTOR (May 2011) (Learn how and when to remove this message)

(Learn how and when to remove this message)

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 Einstein's theory of special relativity^{[citation needed]} the order of events is not always the same to different viewers). This essentially implies working under causal consistency instead of a stronger model.

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 (over 18,000 times as of April 2021^[update] and has grown from nothing to 11.8% of all locking primitives in just under two decades).^[1]

References

^ Paul E. McKenney. "RCU Linux Usage". www.rdrop.com. Retrieved 2021-08-28.

External links

Relativistic Programming at Portland State University

Programming paradigms (Comparison by language)

Imperative

Structured	Jackson structures Block-structured Modular Non-structured Procedural Programming in the large and in the small Design by contract Invariant-based Nested function
Object-oriented (comparison, list)	Class-based, Prototype-based, Object-based Agent Immutable object Persistent Uniform Function Call Syntax

Declarative

Functional (comparison)	Recursive Anonymous function (Partial application) Higher-order Purely functional Total Strict GADTs Dependent types Functional logic Point-free style Expression-oriented Applicative, Concatenative Function-level, Value-level
Dataflow	Flow-based Reactive (Functional reactive) Signals Streams Synchronous
Logic	Abductive logic Answer set Constraint (Constraint logic) Inductive logic Nondeterministic Ontology Probabilistic logic Query
DSL	Algebraic modeling Array Automata-based (Action) Command (Spacecraft) Differentiable End-user Grammar-oriented Interface description Language-oriented List comprehension Low-code Modeling Natural language Non-English-based Page description Pipes and filters Probabilistic Quantum Scientific Scripting Set-theoretic Simulation Stack-based System Tactile Templating Transformation (Graph rewriting, Production, Pattern) Visual

Concurrent,
distributed,
parallel

Metaprogramming

Attribute-oriented
Automatic (Inductive)
Dynamic
Extensible
Generic
Homoiconicity
Interactive
Macro (Hygienic)
Metalinguistic abstraction
Multi-stage
Program synthesis (Bayesian, Inferential, by demonstration, by example)
Reflective
Self-modifying code
Symbolic
Template

Separation
of concerns

This computer science article is a stub. You can help Wikipedia by expanding it.

Categories:

Hidden categories:

See also

References

External links