Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Naama Ben-David"'
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
Publikováno v:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing.
This paper presents a new and practical approach to lock-free locks based on helping, which allows the user to write code using fine-grained locks, but run it in a lock-free manner. Although lock-free locks have been suggested in the past, they are w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b155408f892c88c881552632ae8449c
http://arxiv.org/abs/2201.00813
http://arxiv.org/abs/2201.00813
Non-volatile random access memory (NVRAM) offers byte-addressable persistence at speeds comparable to DRAM. However, with caches remaining volatile, automatic cache evictions can reorder updates to memory, potentially leaving persistent memory in an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35b7ba61e7beff92455f040701b237cc
http://arxiv.org/abs/2108.04202
http://arxiv.org/abs/2108.04202
Autor:
Naama Ben-David, Kartik Nayak
Publikováno v:
PODC
It is well known that Byzantine fault tolerant (BFT) consensus cannot be solved in the classic asynchronous message passing model when one-third or more of the processes may be faulty. Since many modern applications require higher fault tolerance, th
Publikováno v:
ACM SIGACT News. 50:33-45
The 38th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2019) was held on July 29-August 2, 2019 at the Double Tree Hilton hotel in Toronto, Canada. With three keynotes, over 40 accepted papers, over 20 accepted brief announ
Publikováno v:
PPoPP
We present an approach for efficiently taking snapshots of the state of a collection of CAS objects. Taking a snapshot allows later operations to read the value that each CAS object had at the time the snapshot was taken. Taking a snapshot requires a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e1bbd3471601ed8b3fa6043e357a78d
http://arxiv.org/abs/2007.02372
http://arxiv.org/abs/2007.02372
Publikováno v:
PLDI
The recent availability of fast, dense, byte-addressable non-volatile memory has led to increasing interest in the problem of designing and specifying durable data structures that can recover from system crashes. However, designing durable concurrent
Autor:
Naama Ben-David
Publikováno v:
ACM SIGACT News. 49:83-88
The 2018 ACM Symposium on the Principles of Distributed Computing (PODC 2018) was held on July 23-27, at Royal Holloway, University of London, in Egham, UK (see Figure 1). This venue achieved a nice balance between two opposing desirable features of
Publikováno v:
PPOPP
22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Feb 2017, Austin, United States. ⟨10.1145/3018743.3018762⟩
22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Feb 2017, Austin, United States. ⟨10.1145/3018743.3018762⟩
Over the past two decades, many concurrent data structures have been designed and implemented. Nearly all such work analyzes concurrent data structures empirically, omitting asymptotic bounds on their efficiency, partly because of the complexity of t