Block transactional memory: a complexity study

DOI10.1016/J.TCS.2026.116241MaRDI QIDQ7396347zbMATH OpenFDO

Authors Parwat Singh Anjana, Srivatsan Ravi

Publication date 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116241

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Bounds on Multiprocessing Timing Anomalies
• Disjoint-access-parallel implementations of strong shared memory primitives
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Scheduling multithreaded computations by work stealing
• Software transactional memory
• The Cost of Privatization in Software Transactional Memory
• The Parallel Evaluation of General Arithmetic Expressions

This page was built for publication: Block transactional memory: a complexity study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396347)