Distributed Transactional Contention Management as the Traveling Salesman Problem

DOI10.1007/978-3-319-09620-9_6zbMath1416.68026OpenAlexW194026900MaRDI QIDQ5496148

Roberto Palmieri, Bo Zhang, Binoy Ravindran

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_6

zbMATH Keywords

synchronizationdistributed transactional memory

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Distributed systems (68M14)

Related Items (7)

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 ⋮ Ordered scheduling in control-flow distributed transactional memory ⋮ Fast scheduling in distributed transactional memory ⋮ Time-communication impossibility results for distributed transactional memory

This page was built for publication: Distributed Transactional Contention Management as the Traveling Salesman Problem