### Abstract

We investigate scheduling algorithms for distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those objects have been assembled, and then possibly forwards those objects to other waiting transactions. Minimizing execution time in this model is known to be NP-hard for arbitrary communication graphs, and also hard to approximate within any factor smaller than the size of the graph. Nevertheless, networks on chips, multi-core systems, and clusters are not arbitrary. Here, we explore efficient execution schedules in specialized graphs likely to arise in practice: Clique, Line, Grid, Cluster, Hypercube, Butterfly, and Star. In most cases, when individual transactions request k objects, we obtain solutions close to a factor O(k) from optimal, yielding near-optimal solutions for constant k. These execution times approximate the TSP tour lengths of the objects in the graph. We show that for general networks, even for two objects (k = 2), it is impossible to obtain execution time close to the objects' optimal TSP tour lengths, which is why it is useful to consider more realistic network models. To our knowledge, this is the first a.empt to obtain provably fast schedules for distributed transactional memory.

Original language | English (US) |
---|---|

Title of host publication | SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures |

Publisher | Association for Computing Machinery |

Pages | 173-182 |

Number of pages | 10 |

ISBN (Electronic) | 9781450345934 |

DOIs | |

State | Published - Jul 24 2017 |

Externally published | Yes |

Event | 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017 - Washington, United States Duration: Jul 24 2017 → Jul 26 2017 |

### Publication series

Name | Annual ACM Symposium on Parallelism in Algorithms and Architectures |
---|---|

Volume | Part F129316 |

### Conference

Conference | 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017 |
---|---|

Country | United States |

City | Washington |

Period | 7/24/17 → 7/26/17 |

### Keywords

- Approximation
- Contention
- Data-flow model
- Distributed systems
- Execution time
- Scheduling
- Transactional memory

### ASJC Scopus subject areas

- Hardware and Architecture
- Software
- Theoretical Computer Science

## Fingerprint Dive into the research topics of 'Fast scheduling in distributed transactional memory'. Together they form a unique fingerprint.

## Cite this

*SPAA 2017 - Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures*(pp. 173-182). (Annual ACM Symposium on Parallelism in Algorithms and Architectures; Vol. Part F129316). Association for Computing Machinery. https://doi.org/10.1145/3087556.3087565