Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
It is usually expected that quantum gravity corrections will modify somehow the symmetries of special relativity. In this paper… Expand
  • table 1
Is this relevant?
2014
2014
This paper presents algorithms for concurrently reading and modifying a red‐black tree (RBTree). The algorithms allow wait‐free… Expand
Is this relevant?
2013
2013
With the fundamental change of hardware technology, main-memory database systems have emerged as the next generation of DBMS… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2012
2012
Programmers traditionally assume we live and program in a sequentially consistent world. Hardware developers have long since… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
For software to take advantage of modern multicore processors, it must be safely concurrent and it must scale. Many techniques… Expand
  • figure 2.1
  • table 2.1
  • table 2.2
  • table 2.3
  • figure 3.1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2011
2011
Relativistic Programming is a technique that allows low overhead, linearly-scalable concurrent reads. It also allows joint access… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2011
2011
We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
This paper presents a novel concurrent hash table implementation which supports wait-free, near-linearly scalable lookup, even in… Expand
  • figure 2
  • figure 3
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We have carried out numerical simulations of strongly gravitating systems based on the Einstein equations coupled to the… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 2
  • figure 5
Is this relevant?