A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
We present a concurrent programming methodology called relativistic programming and illustrate its use in a concurrent red-black tree implementation. In relativistic programming each thread sees memory through its own temporal frame of reference. This approach to sharing memory allows reading to proceed independent of concurrent updates and avoids the need for expensive atomic instructions in reads. Our relativistic red-black tree has linear read scalability and uncontended read performancedoi:10.1002/cpe.3157 fatcat:mi4fm7gcxvgidgx53oadptipcu