Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Igor Zablotchi"'
Publikováno v:
PODC
Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mechanism to control access permissions. In this paper, we study the fund
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9033e493e16667e54e6042fa0ab2f9e4
https://doi.org/10.1145/3293611.3331601
https://doi.org/10.1145/3293611.3331601
Publikováno v:
SPAA
Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design \em persistent object
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::216a7a1242a4f99b461a31778711d6e8
https://doi.org/10.1145/3210377.3210400
https://doi.org/10.1145/3210377.3210400
Publikováno v:
Networked Systems ISBN: 9783319596464
NETYS
NETYS
Shared objects are the means by which processes gather and exchange information about the state of a distributed system. Objects that disclose more information about the system are therefore more desirable. In this paper, we propose the schedule reco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24f924b4b292ddc29f5e834d90aeeee3
https://doi.org/10.1007/978-3-319-59647-1_17
https://doi.org/10.1007/978-3-319-59647-1_17
Publikováno v:
SPAA
In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69c6947755c80f46faadc0d0c2402c9d
https://doi.org/10.1145/2935764.2935790
https://doi.org/10.1145/2935764.2935790
Classical synchronous consensus algorithms are leaderless: processes exchange their proposals, retain the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are more robust in that they on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d13a99df95d1462c09b1651b7aafba9
https://infoscience.epfl.ch/record/282657
https://infoscience.epfl.ch/record/282657
Autor:
Marcos K. Aguilera, Naama Ben-David, Rachid Guerraoui, Antoine Murat, Athanasios Xygkis, Igor Zablotchi
We propose uBFT, the first State Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only 2f+1 replicas to tolerate f Byzantine failures. The Byzantine Fault Tolerance (BFT) provided by uBFT is essential
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ebc7b36ce473f7aa7bb98ad62234af0
https://infoscience.epfl.ch/record/300366
https://infoscience.epfl.ch/record/300366
Autor:
Karolos Antoniadis, Julien Benhaim, Antoine Desjardins, Elias Poroma, Vincent Gramoli, Rachid Guerraoui, Gauthier Voron, Igor Zablotchi
Classic synchronous consensus algorithms are leaderless in that processes exchange proposals, choose the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are typically leader-based. Alth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e9a649fc30820c4e7b6d9b59256b943
https://infoscience.epfl.ch/record/301833
https://infoscience.epfl.ch/record/301833