NOrec: streamlining STM by abolishing ownership records. Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusually clean semantics. While unlikely to scale to hundreds of active threads, this ”NOrec” system offers many appealing features: very low fast-path latency--as low as any system we know of that admits concurrent updates; publication and privatization safety; livelock freedom; a small, constant amount of global metadata, and full compatibility with existing data structure layouts; no false conflicts due to hash collisions; compatibility with both managed and unmanaged languages, and both static and dynamic compilation; and easy acccommodation of closed nesting, inevitable (irrevocable) transactions, and starvation avoidance mechanisms. To the best of our knowledge, no extant STM system combines this set of features. While transactional memory for processors with hundreds of cores is likely to require hardware support, software implementations will be required for backward compatibility with current and near-future processors with 2--64 cores, as well as for fall-back in future machines when hardware resources are exhausted. Our experience suggests that NOrec may be an ideal candidate for such a software system. We also observe that it has considerable appeal for use within the operating system, and in systems that require both closed nesting and publication safety.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Alistarh, Dan; Kopinsky, Justin; Kuznetsov, Petr; Ravi, Srivatsan; Shavit, Nir: Inherent limitations of hybrid transactional memory (2018)
- Derrick, John; Doherty, Simon; Dongol, Brijesh; Schellhorn, Gerhard; Travkin, Oleg; Wehrheim, Heike: Mechanized proofs of opacity: a comparison of two techniques (2018)
- Gramoli, Vincent; Guerraoui, Rachid; Trigonakis, Vasileios: (\mathrmTM^2\mathrmC): a software transactional memory for many-cores (2018)
- Kuznetsov, Petr; Peri, Sathya: Non-interference and local correctness in transactional memory (2017)
- Gramoli, Vincent; Kuznetsov, Petr; Ravi, Srivatsan: In the search for optimal concurrency (2016)
- Doherty, Simon; Groves, Lindsay; Luchangco, Victor; Moir, Mark: Towards formally specifying and verifying transactional memory (2013)
- Baldassin, Alexandro; Goldstein, Felipe; Azevedo, Rodolfo: A transactional runtime system for the Cell/BE architecture (2012) ioport
- Dalessandro, Luke; Dice, Dave; Scott, Michael; Shavit, Nir; Spear, Michael: Transactional mutex locks (2010)