• Home
  • Search
  • Distributed Transactional Contention Management as the Traveling Salesman Problem
  • Cite Icon15
  • https://doi.org/10.1007/978-3-319-09620-9_6Copy DOI Icon

Distributed Transactional Contention Management as the Traveling Salesman Problem

  • Jan 1, 2014
  • Bo Zhang +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we consider designing contention managers for distributed software transactional memory (DTM), given an input of n transactions sharing s objects in a network of m nodes. We first construct a dynamic ordering conflict graph \(G_c^{*}(\phi(\kappa))\) for an offline algorithm (κ,φ κ ). We show that finding an optimal schedule is equivalent to finding the offline algorithm for which the weight of the longest weighted path in \(G_c^{*}(\phi(\kappa))\) is minimized. We further illustrate that when the set of transactions are dynamically generated, processing transactions according to a χ(G c )-coloring of G c does not lead to an optimal schedule, where χ(G c ) is the chromatic number of G c . We prove that, for DTM, any online work conserving deterministic contention manager provides an \(\Omega(\max[s,\frac{s^2}{\overline{D}}])\) competitive ratio in a network with normalized diameter \(\overline{D}\). Compared with the Ω(s) competitive ratio for multiprocessor STM, the performance guarantee for DTM degrades by a factor proportional to \(\frac{s}{\overline{D}}\). To break this lower bound, we present a randomized algorithm Cutting, which needs partial information of transactions and an approximate algorithm A for the traveling salesman problem with approximation ratio φ A . We show that the average case competitive ratio of Cutting is \(O\big(s\cdot \phi_A\cdot\log^{2} m\log^{2} n\big)\), which is close to O(s).

Similar Papers
  • Conference Article
  • Citations49

Transactional contention management as a non-clairvoyant scheduling problem

  • Jul 23, 2006
  • Hagit Attiya +3
  • Research Article
  • Citations47

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem

  • May 13, 2008
  • Algorithmica
  • Hagit Attiya +3
  • Conference Article
  • Citations257

Toward a theory of transactional contention managers

  • Jul 17, 2005
  • Rachid Guerraoui +2
  • Conference Article
  • Citations17

Scheduling Transactions in Replicated Distributed Software Transactional Memory

  • May 01, 2013
  • Junwhan Kim +1
  • Research Article
  • Citations36

A comprehensive strategy for contention management in software transactional memory

  • Feb 14, 2009
  • ACM SIGPLAN Notices
  • Michael F Spear +3
  • Book Chapter
  • Citations2

Evaluation of Traveling Salesman Problem Instance Hardness by Clustering

  • Sep 24, 2017
  • Pavel Krömer +1
  • Research Article
  • Citations23

Parallel techniques for solving large scale travelling salesperson problems

  • Jan 01, 1992
  • Microprocessors and Microsystems
  • Cp Ravikumar
  • Conference Article
  • Citations3

FBLT: A Real-Time Contention Manager with Improved Schedulability

  • Jan 01, 2013
  • Mohammed Elshambakey +1
  • Book Chapter
  • Citations2

Metaheuristics Approaches for the Travelling Salesman Problem on a Spherical Surface

  • Oct 01, 2020
  • Yusuf Sahin +4
  • Research Article
  • Citations3

Approximately optimal construction of parallel algorithm portfolios by evolutionary intelligence

  • Aug 03, 2022
  • SCIENTIA SINICA Technologica
  • Shengcai Liu +2
  • Conference Article
  • Citations123

CAR-STM

  • Aug 18, 2008
  • Shlomi Dolev +2
  • Research Article
  • Citations77

A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

  • Mar 29, 2008
  • Computers & Operations Research
  • Hipólito Hernández-Pérez +2
  • Conference Article
  • Citations2

Brief announcement

  • Aug 11, 2009
  • Raphael P Eidenbenz +1
  • Research Article
  • Citations63

An improved upper bound for the TSP in cubic 3-edge-connected graphs

  • Nov 17, 2004
  • Operations Research Letters
  • David Gamarnik +2
  • Research Article
  • Citations11

New Approximation Results for the Maximum Scatter TSP

  • Nov 15, 2004
  • Algorithmica
  • Yi-Jen Chiang
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.