Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Hammurabi Mendes"'
Publikováno v:
2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f85fa695bfa11aeff398635f5aa2c08
https://doi.org/10.1109/sbac-pad55451.2022.00012
https://doi.org/10.1109/sbac-pad55451.2022.00012
Autor:
Samuel Thomas, Hammurabi Mendes
Publikováno v:
PODC
We present a lock-free, linearizable, and NUMA-aware data structure that implements sets, maps, and priority queue abstract data types (ADTs), based on using thread-local, sequential maps that are used to "jump" to suitable positions in a lock-free,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d83fd6e1b1d0afdfce659f24ce1164f
https://doi.org/10.1145/3293611.3331576
https://doi.org/10.1145/3293611.3331576
Publikováno v:
SPAA
Nonvolatile, byte-addressable memory (NVM) will soon be commercially available, but registers and caches are expected to remain transient on most machines. Without careful management, the data preserved in the wake of a crash are likely to be inconsi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c34b46c233459cea2f88ce3af8339c4
https://doi.org/10.1145/2935764.2935810
https://doi.org/10.1145/2935764.2935810
Autor:
Alba Cristina Magalhaes Alves de Melo, Alessandro Ferreira Leite, Hammurabi Mendes, Li Weigang, Azzedine Boukerche
Publikováno v:
Cluster Computing. 15:351-361
In this paper, we propose and evaluate a flexible architecture for desktop grids that supports multiple task allocation policies on top of a structured P2P overlay. In our proposal, a Bag-of-Tasks application is submitted to random nodes and placed i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20712f63c2a2be8cd3b047bcf7513d64
https://doi.org/10.1007/s10586-011-0154-y
https://doi.org/10.1007/s10586-011-0154-y
Publikováno v:
Electronic Notes in Discrete Mathematics. 35:263-268
In this extended abstract, we outline a concurrent implementation of a data structure called skip graphs. This data structure, proposed by Aspnes and Shah, has similar functionality to binary search trees, and has also special features that make it s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38185e0d650c70bf7bdb2e1970081a63
https://doi.org/10.1016/j.endm.2009.11.043
https://doi.org/10.1016/j.endm.2009.11.043
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662534250
DISC
DISC
This paper provides a theoretical and practical framework for crash-resilient data structures on a machine with persistent (nonvolatile) memory but transient registers and cache. In contrast to certain prior work, but in keeping with “real world”
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f536bed71a199c342b2a53ebd31c8193
https://doi.org/10.1007/978-3-662-53426-7_23
https://doi.org/10.1007/978-3-662-53426-7_23
Publikováno v:
STOC
In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give the first theorem with necessary and sufficient conditions to solve arbi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74652c93a27ebdd04ce20bdcf3c6c0c3
https://doi.org/10.1145/2591796.2591853
https://doi.org/10.1145/2591796.2591853
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662451731
DISC
DISC
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations are based on skiplists, harnessing the potential for parallelism of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22abe538a3abde724ad69872f3f8454e
https://doi.org/10.1007/978-3-662-45174-8_28
https://doi.org/10.1007/978-3-662-45174-8_28
Autor:
Maurice Herlihy, Hammurabi Mendes
Publikováno v:
STOC
The problem of e-approximate agreement in Byzantine asynchronous systems is well-understood when all values lie on the real line. In this paper, we generalize the problem to consider values that lie in Rm, for m ≥ 1, and present an optimal protocol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f54087897e403dba7a83defbbaacf8c6
https://doi.org/10.1145/2488608.2488657
https://doi.org/10.1145/2488608.2488657
Publikováno v:
SCCC
In order to make shared memory programming possible in distributed architectures, we use an abstraction called distributed shared memory. The behavior of distributed shared memory systems is dictated by the memory consistency model. In order to provi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0689de2dbddf691ae22887bfe71854f1
https://doi.org/10.1109/sccc.2005.1587870
https://doi.org/10.1109/sccc.2005.1587870