Zobrazeno 1 - 10
of 110
pro vyhledávání: '"Erez Petrank"'
Autor:
Chris Hawblitzel, Erez Petrank
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
Garbage collectors are notoriously hard to verify, due to their low-level interaction with the underlying system and the general difficulty in reasoning about reachability in graphs. Several papers have presented verified collectors, but either the p
Externí odkaz:
https://doaj.org/article/bd248fd82f6c46b4a48f3c3da8a80c54
Autor:
Gal Sela, Erez Petrank
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:345-372
The size of a data structure (i.e., the number of elements in it) is a widely used property of a data set. However, for concurrent programs, obtaining a correct size efficiently is non-trivial. In fact, the literature does not offer a mechanism to ob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af7250e309e1c238be70cf278b0d5b7d
https://doi.org/10.1145/3563300
https://doi.org/10.1145/3563300
Publikováno v:
SPAA
Concurrent data structures provide fundamental building blocks for concurrent programming. Standard concurrent data structures may be extended by allowing a sequence of operations to be submitted as a batch for later execution. A sequence of such ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09985bfef90e95e5f6bce53cd41b24ce
https://doi.org/10.1145/3512757
https://doi.org/10.1145/3512757
Autor:
Samuel Thomas, Jiwon Choe, Ofir Gordon, Erez Petrank, Tali Moreshet, Maurice Herlihy, R. Iris Bahar
Publikováno v:
2022 IEEE High Performance Extreme Computing Conference (HPEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb3ee5f3517af84a45ae063cf74d5a08
https://doi.org/10.1109/hpec55821.2022.9926323
https://doi.org/10.1109/hpec55821.2022.9926323
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
Publikováno v:
SPAA
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic methods (or their combinations): epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch-based methods are fast, but do not guarantee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1340aaa234391d51cf3a4e97405d0402
http://arxiv.org/abs/2107.13843
http://arxiv.org/abs/2107.13843
Publikováno v:
PODC
Linearizability is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions as correct if operations on shared objects appear to take effect inst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8afffbe4ef9f4f9328c88a899f020dc
https://doi.org/10.1145/3465084.3467944
https://doi.org/10.1145/3465084.3467944
Autor:
Erez Petrank, Gal Sela
Publikováno v:
SPAA
We consider durable data structures for non-volatile main memory, such as the new Intel Optane memory architecture. Substantial recent work has concentrated on making concurrent data structures durable with low overhead, by adding a minimal number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3446ba20942d449b913ee2a93f535c64
http://arxiv.org/abs/2105.08706
http://arxiv.org/abs/2105.08706
Autor:
Gali Sheffi, Erez Petrank
Publikováno v:
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.
Hardware and software faults increasingly surface in today's computing environment and vast theoretical and practical research efforts are devoted to ameliorate the effects of malfunctionality in the computing process. Most research to date, however,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2ff2940765b966ab274a0cbce2ec1a3
https://doi.org/10.1145/3350755.3400261
https://doi.org/10.1145/3350755.3400261
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e9fd649a43601678136d4f0ace4453b
https://doi.org/10.1145/3385412.3386031
https://doi.org/10.1145/3385412.3386031