Fast scheduling in distributed transactional memory

DOI10.1007/S00224-020-10008-7zbMath1464.68036OpenAlexW3094451109MaRDI QIDQ2035479

Costas Busch, Miroslav Popovic, Gokarna Sharma, Maurice P. Herlihy

Publication date: 24 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-10008-7

zbMATH Keywords

schedulingdistributed systemsapproximationexecution timetransactional memorycontentiondata-flow model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (4)

Dynamic scheduling in distributed transactional memory ⋮ Stable scheduling in transactional memory ⋮ Flexible scheduling of transactional memory on trees ⋮ Flexible scheduling of transactional memory on trees

Cites Work

• Unnamed Item
• Unnamed Item
• On speculative replication of transactional systems
• 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
• Distributed transactional memory for general networks
• A competitive analysis for balanced transactional memory workloads
• Impossibility Results for Distributed Transactional Memory
• Software transactional memory
• Toward a theory of transactional contention managers
• Distributed Transactional Contention Management as the Traveling Salesman Problem

This page was built for publication: Fast scheduling in distributed transactional memory