Relativistic programming

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Relativistic programming (RP) is a concurrent programming model in which readers can safely access shared data concurrently with… (More)
  • figure 4
  • figure 1
  • figure 5
  • figure 3
  • figure 6
Is this relevant?
2014
2014
Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 4
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… (More)
  • figure 2.1
  • table 2.1
  • table 2.2
  • table 2.3
  • figure 3.1
Is this relevant?
2012
2012
Programmers traditionally assume we live and program in a sequentially consistent world. Hardware developers have long since… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
High-performance programs and systems require concurrency to take full advantage of available hardware. However, the available… (More)
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
2011
2011
We present algorithms for shrinking and expanding a hash table while allowing concurrent, wait-free, linearly scalable lookups… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2011
2011
We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run… (More)
Is this relevant?
2011
2011
Relativistic Programming is a technique that allows low overhead, linearly-scalable concurrent reads. It also allows joint access… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2010
2010
This paper presents a novel concurrent hash table implementation which supports wait-free, near-linearly scalable lookup, even in… (More)
  • figure 2
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?