Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,895,259 papers from all fields of science
Search
Sign In
Create Free Account
Relativistic programming
Relativistic programming (RP) is a style of concurrent programming where instead of trying to avoid conflicts between readers and writers (or writers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (1)
Concurrent computing
Linux
Non-blocking algorithm
Outline 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
Germán Albalate
,
J. Carmona
,
J. Cortés
,
J. J. Relancio
Symmetry
2018
Corpus ID: 53567148
It is usually expected that quantum gravity corrections will modify somehow the symmetries of special relativity. In this paper…
Expand
2015
2015
Relativistic Perturbations and Ontological Implications: Exploring the Zitterbewegung and Laying the Groundwork for a Quantum Ontology
Saul B Propp
2015
Corpus ID: 120836172
2014
2014
The Future is the Past
R. Schlafly
2014
Corpus ID: 172142331
Modern physics has come to conclusions about time, causality, and reality that have outpaced our language and intuitions. The…
Expand
2014
2014
Relativistic red‐black trees
P. Howard
,
J. Walpole
Concurrency and Computation
2014
Corpus ID: 14834923
This paper presents algorithms for concurrently reading and modifying a red‐black tree (RBTree). The algorithms allow wait‐free…
Expand
2013
2013
An Evaluation of Strict Timestamp Ordering Concurrency Control for Main-Memory Database Systems
Henrik Mühe
,
Stephan Wolf
,
A. Kemper
,
Thomas Neumann
IMDM@VLDB
2013
Corpus ID: 2108741
With the fundamental change of hardware technology, main-memory database systems have emerged as the next generation of DBMS…
Expand
2012
2012
Extending relativistic programming to multiple writers
J. Walpole
,
P. Howard
2012
Corpus ID: 61770294
For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques…
Expand
Highly Cited
2011
Highly Cited
2011
Resizable, Scalable, Concurrent Hash Tables via Relativistic Programming
J. Triplett
,
P. McKenney
,
J. Walpole
USENIX Annual Technical Conference
2011
Corpus ID: 3052897
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups…
Expand
2011
2011
Generalized Construction of Scalable Concurrent Data Structures via Relativistic Programming
J. Triplett
,
P. McKenney
,
P. Howard
,
J. Walpole
2011
Corpus ID: 11245759
We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient…
Expand
2010
2010
Scalable concurrent hash tables via relativistic programming
J. Triplett
,
P. McKenney
,
J. Walpole
OPSR
2010
Corpus ID: 254359
This paper presents a novel concurrent hash table implementation which supports wait-free, near-linearly scalable lookup, even in…
Expand
1980
1980
Toward A Concept of Scientific Theory Through Special Relativity
Jorge Bosch
1980
Corpus ID: 115474227
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)
ACCEPT & CONTINUE