Skip to search formSkip to main contentSkip to account menu

Relativistic programming

Relativistic programming (RP) is a style of concurrent programming where instead of trying to avoid conflicts between readers and writers (or writers… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Concurrent computing
LinuxNon-blocking algorithmOutline of computer programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Twin Peaks: A Possible Signal in the Production of Resonances beyond Special Relativity
It is usually expected that quantum gravity corrections will modify somehow the symmetries of special relativity. In this paper… 
2015
2015
Relativistic Perturbations and Ontological Implications: Exploring the Zitterbewegung and Laying the Groundwork for a Quantum Ontology
2014
2014
The Future is the Past
Modern physics has come to conclusions about time, causality, and reality that have outpaced our language and intuitions. The… 
2014
2014
Relativistic red‐black trees
This paper presents algorithms for concurrently reading and modifying a red‐black tree (RBTree). The algorithms allow wait‐free… 
2013
2013
An Evaluation of Strict Timestamp Ordering Concurrency Control for Main-Memory Database Systems
With the fundamental change of hardware technology, main-memory database systems have emerged as the next generation of DBMS… 
2012
2012
Extending relativistic programming to multiple writers
For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques… 
Highly Cited
2011
Highly Cited
2011
Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups… 
2011
2011
Generalized Construction of Scalable Concurrent Data Structures via Relativistic Programming
We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient… 
2010
2010
Scalable concurrent hash tables via relativistic programming
This paper presents a novel concurrent hash table implementation which supports wait-free, near-linearly scalable lookup, even in… 
1980
1980
Toward A Concept of Scientific Theory Through Special Relativity
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)