Efficient algorithms for persistent transactional memory

Pedro Ramalhete, Andreia Correia, Pascal Felber

Open source

DOI
10.1145/3437801.3441586
Published
2021-02-17
Container
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Publisher
ACM
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1145/3437801.3441586,
  title = {Efficient algorithms for persistent transactional memory},
  author = {Pedro Ramalhete and Andreia Correia and Pascal Felber},
  year = {2021},
  journal = {Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
  doi = {10.1145/3437801.3441586},
  url = {https://doi.org/10.1145/3437801.3441586}
}

RIS

TY  - JOUR
TI  - Efficient algorithms for persistent transactional memory
AU  - Pedro Ramalhete
AU  - Andreia Correia
AU  - Pascal Felber
PY  - 2021
JO  - Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
DO  - 10.1145/3437801.3441586
UR  - https://doi.org/10.1145/3437801.3441586
ER  - 

APA

Ramalhete, P., Correia, A., & Felber, P. (2021). Efficient algorithms for persistent transactional memory. Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. https://doi.org/10.1145/3437801.3441586

Source records