Impossibility results for distributed transactional memory

DOI10.1145/2767386.2767433zbMATH Open1333.68137OpenAlexW2074415746MaRDI QIDQ2796258FDOQ2796258

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

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

zbMATH Keywords

distributed systemsimpossibility resultsexecution timetransactional memorycommunication cost

Mathematics Subject Classification ID

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

Cites Work

• Memorization and Association on a Realistic Neural Model
• Title not available (Why is that?)

Cited In (5)

• Ordered scheduling in control-flow distributed transactional memory
• Flexible scheduling of transactional memory on trees
• Time-communication impossibility results for distributed transactional memory
• Fast scheduling in distributed transactional memory
• Dynamic scheduling in distributed transactional memory

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)