Fast Scheduling in Distributed Transactional Memory-Reference-Cited by-同舟云学术

Fast Scheduling in Distributed Transactional Memory

Published:2017-07-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Busch Costas¹,Herlihy Maurice²,Popovic Miroslav³,Sharma Gokarna⁴

Affiliation:

1. Louisiana State University, Baton Rouge, LA, USA

2. Brown University, Providence, RI, USA

3. University of Novi Sad, Novi Sad, Serbia

4. Kent State University, Kent, OH, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3087556.3087565

Reference36 articles.

1. Hagit Attiya Leah Epstein Hadas Shachnai and Tami Tamir. 2010. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.Algorithmica 57 1 (2010) 44--61. 10.1007/s00453-008-9195-x Hagit Attiya Leah Epstein Hadas Shachnai and Tami Tamir. 2010. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.Algorithmica 57 1 (2010) 44--61. 10.1007/s00453-008-9195-x

2. Robert L. Bocchino Vikram S. Adve and Bradford L. Chamberlain. 2008. Software transactional memory for large scale clusters. In PPoPP. 247--258. x978--1--59593--795--7 10.1145/1345206.1345242 Robert L. Bocchino Vikram S. Adve and Bradford L. Chamberlain. 2008. Software transactional memory for large scale clusters. In PPoPP. 247--258. x978--1--59593--795--7 10.1145/1345206.1345242

3. Costas Busch Maurice Herlihy Miroslav Popovic and Gokarna Sharma. 2015. Impossibility Results for Distributed Transactional Memory. In PODC. 207--215. http://dx.doi.org/10.1145/2767386.2767433 10.1145/2767386.2767433 Costas Busch Maurice Herlihy Miroslav Popovic and Gokarna Sharma. 2015. Impossibility Results for Distributed Transactional Memory. In PODC. 207--215. http://dx.doi.org/10.1145/2767386.2767433 10.1145/2767386.2767433

4. Harold W. Cain Maged M. Michael Brad Frey Cathy May Derek Williams and Hung Q. Le. 2013. Robust architectural support for transactional memory in the power architecture. In ISCA. 225--236. http://dx.doi.org/10.1145/2485922.2485942 10.1145/2485922.2485942 Harold W. Cain Maged M. Michael Brad Frey Cathy May Derek Williams and Hung Q. Le. 2013. Robust architectural support for transactional memory in the power architecture. In ISCA. 225--236. http://dx.doi.org/10.1145/2485922.2485942 10.1145/2485922.2485942

5. Henri Casanova Arnaud Legrand and Yves Robert. 2008. Parallel Algorithms (1st ed.). Chapman & Hall/CRC. x9781584889458 Henri Casanova Arnaud Legrand and Yves Robert. 2008. Parallel Algorithms (1st ed.). Chapman & Hall/CRC. x9781584889458

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

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

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

3. Dynamic scheduling in distributed transactional memory;Distributed Computing;2021-11-20

4. Processing Distributed Transactions in a Predefined Order;International Conference on Distributed Computing and Networking 2021;2021-01-05

5. Fast Scheduling in Distributed Transactional Memory;Theory of Computing Systems;2020-10-23