Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures

Authors Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, Marcos K. Aguilera



PDF
Thumbnail PDF

File

LIPIcs.DISC.2017.45.pdf
  • Filesize: 0.66 MB
  • 3 pages

Document Identifiers

Author Details

Irina Calciu
Siddhartha Sen
Mahesh Balakrishnan
Marcos K. Aguilera

Cite AsGet BibTex

Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera. Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 45:1-45:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.DISC.2017.45

Abstract

Recent work introduced a method to automatically produce concurrent data structures for NUMA architectures. We present a summary of that work.
Keywords
  • concurrent data structures
  • log
  • NUMA architecture
  • replication

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera. Black-box concurrent data structures for NUMA architectures. In International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 207-221. ACM, 2017. URL: http://dx.doi.org/10.1145/3037697.3037721.
  2. Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 355-364, June 2010. URL: http://dx.doi.org/10.1145/1810479.1810540.
  3. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990. URL: http://dx.doi.org/10.1145/78969.78972.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail