Impossibility results for distributed transactional memory

DOI10.1145/2767386.2767433MaRDI QIDQ2796258zbMATH OpenOpenAlexFDO

Authors Costas Busch, Miroslav Popovic, Gokarna Sharma, Maurice Herlihy

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767433

zbMATH Keywords

communication costdistributed systemsexecution timeimpossibility resultstransactional memory

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Time-communication impossibility results for distributed transactional memory
• Fast scheduling in distributed transactional memory
• Dynamic scheduling in distributed transactional memory
• Flexible scheduling of transactional memory on trees
• Hundreds of impossibility results for distributed computing

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(6)

• Fast scheduling in distributed transactional memory
• Time-communication impossibility results for distributed transactional memory
• Dynamic scheduling in distributed transactional memory
• Flexible scheduling of transactional memory on trees
• Ordered scheduling in control-flow distributed transactional memory
• A poly-log approximation for transaction scheduling in fog-cloud computing and beyond

This page was built for publication: Impossibility results for distributed transactional memory

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