Results 241 to 250 of about 34,722 (290)
Synthesis of BaZrS<sub>3</sub> Perovskite Thin Films via Different Solid BaS <sub><i>x</i></sub> Intermediate Phases. [PDF]
ACS OmegaComparotto C +5 more
europepmc +1 more source
Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References [PDF]
Lecture Notes in Computer Science, 2008 . We present a type-based deadlock-freedom verification for concurrent programs with non-block-structured lock primitives and mu-table references. Though those two features are frequently used, they are not dealt with in a sufficient manner by previous ...
Suenaga, Kohei
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2020
One of the key challenges in developing multiuser, database-driven applications is to maximize concurrent access and, at the same time, ensure that each user is able to read and modify the data in a consistent fashion. The locking mechanisms that allow this to happen are key features of any database, and Oracle excels in providing them. However, Oracle’
Darl Kuhn, Thomas Kyte
openaire +1 more source
One of the key challenges in developing multiuser, database-driven applications is to maximize concurrent access and, at the same time, ensure that each user is able to read and modify the data in a consistent fashion. The locking mechanisms that allow this to happen are key features of any database, and Oracle excels in providing them. However, Oracle’
Darl Kuhn, Thomas Kyte
openaire +1 more source
General and efficient locking without blocking
Proceedings of the 2008 ACM SIGPLAN workshop on Memory systems performance and correctness: held in conjunction with the Thirteenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '08), 2008Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of actual contention. Locking offers lower overheads, but typically reduces concurrency due to the difficulty of associating locks with the exact data that need to be accessed ...
Yannis Smaragdakis +3 more
openaire +2 more sources
Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92, 1992
Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.This paper proposes a technique that can convert most existing lock-based blocking data ...
John Turek +2 more
openaire +2 more sources
Nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. This is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.This paper proposes a technique that can convert most existing lock-based blocking data ...
John Turek +2 more
openaire +2 more sources
Locking the Design of Building Blocks for Quantum Circuits
ACM Transactions on Embedded Computing Systems, 2019The research community expects that quantum computers will give economical results for particular problems on which the classical computers break down. Examples include factoring of large numbers, searching in a big database, or simulating chemical reactions to design new drugs. Attempts are ongoing to build up a practical quantum computer.
Samah Mohamed Saeed +2 more
openaire +1 more source
Updatable Block-Level Message-Locked Encryption
IEEE Transactions on Dependable and Secure Computing, 2017Deduplication is widely used for reducing the storage requirement for storage service providers. Nevertheless, it is unclear how to support deduplication of encrypted data securely until the study of Bellare et al. on message-locked encryption (MLE, Eurocrypt 2013). While updating (shared) files is natural, existing MLE solutions do not allow efficient
Yongjun Zhao 0001, Sherman S. M. Chow
openaire +2 more sources