Flexible scheduling of transactional memory on trees

DOI10.1016/j.tcs.2023.114184MaRDI QIDQ6073888

Maurice P. Herlihy, Pavan Poudel, Bogdan S. Chlebus, Costas Busch, Gokarna Sharma, Miroslav Popovic

Publication date: 12 October 2023

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

zbMATH Keywords

networkdistributed systemtransactional memorycommunication costshared object

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Transactional contention management as a Non-clairvoyant scheduling problem
• Window-based greedy contention management for transactional memory: theory and practice
• Distributed transactional memory for metric-space networks
• Fast scheduling in distributed transactional memory
• Time-communication impossibility results for distributed transactional memory
• Distributed transactional memory for general networks
• HiperTM: high performance, fault-tolerant transactional memory
• A competitive analysis for balanced transactional memory workloads
• Software transactional memory
• Toward a theory of transactional contention managers
• Distributed Transactional Contention Management as the Traveling Salesman Problem
• Flexible scheduling of transactional memory on trees
• Load balanced distributed directories

This page was built for publication: Flexible scheduling of transactional memory on trees