Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Liuba Shrira"'
Publikováno v:
The VLDB Journal. 31:1291-1309
Modern distributed data management systems face a new challenge: how can autonomous, mutually-distrusting parties cooperate safely and effectively? Addressing this challenge brings up questions familiar from classical distributed systems: how to comb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3fbc03a790cfa791e711c0ce4e13f31c
https://doi.org/10.1007/s00778-021-00686-1
https://doi.org/10.1007/s00778-021-00686-1
Publikováno v:
VLDB Endowment
Optimistic concurrency control, or OCC, can achieve excellent performance on uncontended workloads for main-memory transactional databases. Contention causes OCC's performance to degrade, however, and recent concurrency control designs, such as hybri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::610634ccfb7b64b227166f2947600c8c
https://doi.org/10.14778/3377369.3377373
https://doi.org/10.14778/3377369.3377373
Publikováno v:
Principles of Blockchain Systems ISBN: 9783031006791
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abe194aff300edb1d7b2150ca70d7a6f
https://doi.org/10.1007/978-3-031-01807-7_5
https://doi.org/10.1007/978-3-031-01807-7_5
Autor:
Liuba Shrira, Nikos Tsikoudis
Publikováno v:
SIGMOD Conference
One can audit SQL applications by running SQL programs over sequences of persistent snapshots, but care is needed to avoid wasteful duplicate computation. This paper describes the design, implementation, and performance of RID, the first language-ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81a8226c82f1f1794628897b0e388cd1
https://doi.org/10.1145/3318464.3380580
https://doi.org/10.1145/3318464.3380580
Autor:
Liuba Shrira, Barbara Liskov, Lillian Tsai, Jeevana Priya Inala, Eddie Kohler, Yihe Huang, Nathaniel Herman
Publikováno v:
EuroSys
It is often possible to improve a concurrent system's performance by leveraging the semantics of its datatypes. We build a new software transactional memory (STM) around this observation. A conventional STM tracks read- and write-sets of memory words
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4097e166fedb1439bf04d2962c8bfbc3
https://doi.org/10.1145/2901318.2901348
https://doi.org/10.1145/2901318.2901348
Autor:
Liuba Shrira, Magnus E. Bjornsson
Publikováno v:
OOPSLA
Collaborative applications provide a shared work environment for groups of networked clients collaborating on a common task. They require strong consistency for shared persistent data and efficient access to fine-grained objects. These properties are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b683d16bee94194a514900228956799f
https://doi.org/10.1145/583854.582423
https://doi.org/10.1145/583854.582423
Autor:
Sanjay Ghemawat, Atul Adya, Liuba Shrira, Umesh Maheshwari, Robert Gruber, Barbara Liskov, Andrew C. Myers, Miguel Castro, Mark Stuart Day
Publikováno v:
SIGMOD Conference
Thor is an object-oriented database system designed for use in a heterogeneous distributed environment. It provides highly-reliable and highly-available persistent storage for objects, and supports safe sharing of these objects by applications writte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f93af10f1dce6571938e075ac66b9dae
https://doi.org/10.1145/235968.233346
https://doi.org/10.1145/235968.233346
Publikováno v:
ACM Transactions on Computer Systems. 10:360-391
To provide high availability for services such as mail or bulletin boards, data must be replicated. One way to guarantee consistency of replicated data is to force service operations to occur in the same order at all sites, but this approach is expen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1c9fdbb99476cff125c06bc7ffd297e
https://doi.org/10.1145/138873.138877
https://doi.org/10.1145/138873.138877
Autor:
Liuba Shrira, Oded Goldreich
Publikováno v:
Distributed Computing. 5:121-131
We investigate the message complexity of distributed computations on rings of asynchronous processors. In such computations, each processor has an initial local value and the task is to compute some predetermined function of all local values. Our wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0cd47cf9f2975a565804c73670ebf75
https://doi.org/10.1007/bf02252955
https://doi.org/10.1007/bf02252955
Publikováno v:
ACM SIGOPS Operating Systems Review. 25:49-55
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::602a8cf63c71cb17e50695a792c6f106
https://doi.org/10.1145/122140.122144
https://doi.org/10.1145/122140.122144