Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Theory of computation → Shared memory algorithms"'
The paper studies query evaluation in parallel constant time in the PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time on an appropriate CRCW-PRAM, this paper is interested in the efficiency of ev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c51b011b19e647362744dff50811ba7
http://arxiv.org/abs/2301.08178
http://arxiv.org/abs/2301.08178
Autor:
Attiya, Hagit, Ellen, Faith
Approximate agreement allows a set of n processes to obtain outputs that are within a specified distance ε > 0 of one another and within the convex hull of the inputs. When the inputs are real numbers, there is a wait-free shared-memory approximate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::493e6d452c55a2e7d58c4b8ea97515a2
Autor:
Geerts, Floris, Vandevoort, Brecht
LIPIcs, Volume 255, ICDT 2023, Complete Volume
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 1-466
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::293fb00994779f2d5c23730505bad861
Autor:
Penschuck, Manuel
Shuffling is the process of placing elements into a random order such that any permutation occurs with equal probability. It is an important building block in virtually all scientific areas. We engineer, - to the best of our knowledge - for the first
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::304a543c456744a29c3576a4d228d873
Autor:
Geerts, Floris, Vandevoort, Brecht
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 0:i-0:xvi
LIPIcs, Vol. 255, 26th International Conference on Database Theory (ICDT 2023), pages 0:i-0:xvi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62ddafc82ec006344afaa8f2a27df420
Autor:
Bhattacharya, Arghya, Chowdhury, Abiyaz, Xu, Helen, Das, Rathish, Chowdhury, Rezaul A., Johnson, Rob, Nithyanand, Rishab, Bender, Michael A.
Cache-adaptive algorithms are a class of algorithms that achieve optimal utilization of dynamically changing memory. These memory fluctuations are the norm in today’s multi-threaded shared-memory machines and time-sharing caches. Bender et al. [Ben
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::baecabfa0c9b12bd000414acd7ad6208
Front Matter, Table of Contents, Preface, Conference Organization
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 0:i-0:xxii
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c19753a37740f965274159d7f92b57a5
The emergence of systems with non-volatile main memory (NVRAM) increases the need for persistent concurrent objects. Of specific interest are recoverable implementations that, in addition to being robust to crash-failures, are also detectable. Detect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc0cb8012f6c100f030d730ca76cf3e2
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
LIPIcs, Vol. 244, 30th Annual European Symposium on Algorithms (ESA 2022), pages 1-1406
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee4feba6a7425c51d63f41832c606963
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
https://drops.dagstuhl.de/opus/volltexte/2022/16937/
Autor:
Hwang, Steven Munsu, Woelfel, Philipp
Strong linearizability is a correctness condition conceived to address the inadequacies of linearzability when using implemented objects in randomized algorithms. Due to its newfound nature, not many strongly linearizable implementations of data stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::343fdd7dbb0821b1f2e1c11e94ee6b80