Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Karolos Antoniadis"'
Publikováno v:
ICDCS
In a non-uniform memory access machine, the placement of software threads to hardware cores can have a significant effect on the performance of concurrent applications. Detecting the best possible placement for each application is a necessity for thr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4219b010422db2e498603c9b1c53c0c
https://doi.org/10.1109/icdcs47774.2020.00050
https://doi.org/10.1109/icdcs47774.2020.00050
Publikováno v:
Distributed Computing. 31:389-417
We ask to what extent processes communicating through shared memory can extract randomness from their underlying scheduler, e.g., to generate random numbers for cryptographic applications. We introduce the quantitative notions of entropy rate and inf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91aba8c1c9cd1c560285b7bd41fffef6
https://doi.org/10.1007/s00446-017-0311-5
https://doi.org/10.1007/s00446-017-0311-5
Autor:
Karolos Antoniadis, Rachid Guerraoui
Publikováno v:
Concurrency: the Works of Leslie Lamport
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1b0b56fa4a69b08ebc2a7299b1101b0
https://doi.org/10.1145/3335772.3335777
https://doi.org/10.1145/3335772.3335777
Publikováno v:
Networked Systems ISBN: 9783319596464
NETYS
NETYS
Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ca0f970600faa89c7bdaeb84f9d056b
https://doi.org/10.1007/978-3-319-59647-1_30
https://doi.org/10.1007/978-3-319-59647-1_30
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:
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
Publikováno v:
IPDPS
We prove that transactions cannot be fast in an asynchronous fault-tolerant system. Our result holds in any system where we require transactions to ensure monotonic writes, or any stronger consistency model, such as, causal consistency. Thus, our res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::480841743ea44659813a3d25f5d384e1
https://infoscience.epfl.ch/record/286499
https://infoscience.epfl.ch/record/286499