Stable scheduling in transactional memory

DOI10.1007/978-3-031-30448-4_13arXiv2208.07359MaRDI QIDQ6057326

No author found.

Publication date: 4 October 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.07359

zbMATH Keywords

stabilitylatencytransactional memoryshared objectadversarial modeldynamic transaction generation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Transactional scheduling for read-dominated workloads
• Transactional contention management as a Non-clairvoyant scheduling problem
• Packet latency of deterministic broadcasting in adversarial multiple access channels
• Distributed transactional memory for metric-space networks
• Fast scheduling in distributed transactional memory
• Time-communication impossibility results for distributed transactional memory
• Dynamic scheduling in distributed transactional memory
• Distributed transactional memory for general networks
• Maximum throughput of multiple access channels in adversarial environments
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Adversarial Queuing on the Multiple Access Channel
• Software transactional memory
• Distributed Transactional Contention Management as the Traveling Salesman Problem

This page was built for publication: Stable scheduling in transactional memory