Distributed Transactional Contention Management as the Traveling Salesman Problem-Reference-Cited by-同舟云学术

Distributed Transactional Contention Management as the Traveling Salesman Problem

Published:2014 Issue: Volume: Page:54-67
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Zhang Bo,Ravindran Binoy,Palmieri Roberto

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-09620-9_6

Reference21 articles.

1. Attiya, H., Epstein, L., Shachnai, H., Tamir, T.: Transactional contention management as a non-clairvoyant scheduling problem. In: PODC, pp. 308–315 (2006)

2. Christofides, N.: Worst case analysis of a new heuristic for the traveling salesman problem. Technical Report CS-93-13, G.S.I.A., Carnegie Mellon University, Pittsburgh, USA (1976)

3. Diegues, N.L., Romano, P.: Bumper: Sheltering Transactions from Conflicts. In: SRDS, pp. 185–194 (2013)

4. Diegues, N.L., Romano, P.: Time-warp: lightweight abort minimization in transactional memory. In: PPOPP, pp. 167–178 (2014)

5. Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: PODC, pp. 258–264 (2005)

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ordered scheduling in control-flow distributed transactional memory;Theoretical Computer Science;2024-04

2. Flexible scheduling of transactional memory on trees;Theoretical Computer Science;2023-11

3. Obstruction-Free Distributed Transactional Memory;Proceedings of the XXVII Brazilian Symposium on Programming Languages;2023-09-25

4. Ordered Scheduling in Control-Flow Distributed Transactional Memory;Lecture Notes in Computer Science;2023

5. Stable Scheduling in Transactional Memory;Lecture Notes in Computer Science;2023