Obserwuj
Naama Ben-David
Naama Ben-David
Zweryfikowany adres z technion.ac.il - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
NVTraverse: in NVRAM data structures, the destination is more important than the journey
M Friedman, N Ben-David, Y Wei, GE Blelloch, E Petrank
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
692020
Parallel algorithms for asymmetric read-write costs
N Ben-David, GE Blelloch, JT Fineman, PB Gibbons, Y Gu, C McGuffey, ...
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
622016
Delay-free concurrency on faulty persistent memory
N Ben-David, GE Blelloch, M Friedman, Y Wei
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 253-264, 2019
592019
Microsecond consensus for microsecond applications
MK Aguilera, N Ben-David, R Guerraoui, VJ Marathe, A Xygkis, I Zablotchi
14th USENIX Symposium on Operating Systems Design and Implementation (OSDI …, 2020
532020
The impact of RDMA on agreement
MK Aguilera, N Ben-David, R Guerraoui, V Marathe, I Zablotchi
Proceedings of the 2019 ACM symposium on principles of distributed computing …, 2019
432019
Passing messages while sharing memory
MK Aguilera, N Ben-David, I Calciu, R Guerraoui, E Petrank, S Toueg
Proceedings of the 2018 ACM symposium on principles of distributed computing …, 2018
322018
Implicit decomposition for write-efficient connectivity algorithms
N Ben-David, G Blelloch, J Fineman, P Gibbons, Y Gu, C McGuffey, ...
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018
322018
Constant-time snapshots with applications to concurrent data structures
Y Wei, N Ben-David, GE Blelloch, P Fatourou, E Ruppert, Y Sun
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021
272021
Multiversion concurrency with bounded delay and precise garbage collection
N Ben-David, GE Blelloch, Y Sun, Y Wei
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 241-252, 2019
22*2019
Sentence segmentation of aphasic speech
KC Fraser, N Ben-David, G Hirst, N Graham, E Rochon
Proceedings of the 2015 conference of the North American chapter of the …, 2015
202015
Efficient and adaptively secure asynchronous binary agreement via binding crusader agreement
I Abraham, N Ben-David, S Yandamuri
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
182022
MU-MMINT: an IDE for model uncertainty
M Famelis, N Ben-David, A Di Sandro, R Salay, M Chechik
2015 IEEE/ACM 37th IEEE International Conference on Software Engineering 2 …, 2015
182015
ubft: Microsecond-scale bft using disaggregated memory
MK Aguilera, N Ben-David, R Guerraoui, A Murat, A Xygkis, I Zablotchi
Proceedings of the 28th ACM International Conference on Architectural …, 2023
162023
Analyzing contention and backoff in asynchronous shared memory
N Ben-David, GE Blelloch
Proceedings of the ACM Symposium on Principles of Distributed Computing, 53-62, 2017
142017
Contention in structured concurrency: Provably efficient dynamic non-zero indicators for nested parallelism
UA Acar, N Ben-David, M Rainey
ACM SIGPLAN Notices 52 (8), 75-88, 2017
14*2017
FliT: a library for simple and efficient persistent algorithms
Y Wei, N Ben-David, M Friedman, GE Blelloch, E Petrank
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of …, 2022
132022
Space and time bounded multiversion garbage collection
N Ben-David, GE Blelloch, P Fatourou, E Ruppert, Y Sun, Y Wei
arXiv preprint arXiv:2108.02775, 2021
82021
Revisiting the power of non-equivocation in distributed protocols
N Ben-David, BY Chan, E Shi
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
72022
Brief announcement: Survey of persistent memory correctness conditions
N Ben-David, M Friedman, Y Wei
36th International Symposium on Distributed Computing (DISC 2022), 2022
7*2022
Classifying trusted hardware via unidirectional communication
N Ben-David, K Nayak
arXiv preprint arXiv:2105.10566, 2021
7*2021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20