Results 21 to 30 of about 14,769 (187)
On the Serializability of Transactions in JavaSpaces
Electronic Notes in Theoretical Computer Science, 2001 AbstractJavaSpaces is a coordination infrastructure inspired by the shared dataspace model: processes interact by introducing, consuming, and testing for the presence/absence of data in a common repository. Besides these traditional operations, an event based coordination mechanism is considered which allows for the notification of the introduction of ...
Busi, Nadia, Zavattaro, Gianluigi
openaire +3 more sources
The Serializable and Incremental Semantic Reasoner fuzzyDL [PDF]
2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), 2020 Serializable and incremental semantic reasoners make it easier to reason on a mobile device with limited resources, as they allow the reuse of previous inferences computed by another device without starting from scratch. This paper describes an extension of the fuzzy ontology reasoner fuzzyDL to make it the first serializable and incremental semantic ...
Huitzil I +4 more
openaire +6 more sources
Declarative Serializable Snapshot Isolation [PDF]
, 2011 Snapshot isolation (SI) is a popular concurrency control protocol, but it permits non-serializable schedules that violate database integrity. The Serializable Snapshot Isolation (SSI) protocol ensures (view) serializability by preventing pivot structures in SI schedules.
Tilgner, Christian +3 more
openaire +2 more sources
Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability
International Conference on Architectural Support for Programming Languages and Operating Systems, 2015 Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors.
Aritra Sengupta +4 more
semanticscholar +1 more source
Universally Serializable Computation
Journal of Computer and System Sciences, 1997 Cai and Furst proved that every PSPACE language can be solved via a large number of identical simple tasks, each of which is provided with the original input, its own unique task number, and at most three bits of output from the previous task. In the Cai?Furst model, the tasks are required to be run in the order specified by the task numbers.
Lane A. Hemaspaandra, Mitsunori Ogihara
openaire +2 more sources
Complexity, 2018 Healthcare systems are growing very fast, especially emergency departments (EDs) which constitute the major bottleneck of these complex concurrent systems.
Soraia Oueida +3 more
doaj +1 more source
Transaction chains: achieving serializability with low latency in geo-distributed storage systems
Symposium on Operating Systems Principles, 2013 Currently, users of geo-distributed storage systems face a hard choice between having serializable transactions with high latency, or limited or no transactions with low latency.
Yang Zhang +5 more
semanticscholar +1 more source
Rethinking serializable multiversion concurrency control [PDF]
Proceedings of the VLDB Endowment, 2015 Multi-versioned database systems have the potential to significantly increase the amount of concurrency in transaction processing because they can avoid read-write conflicts. Unfortunately, the increase in concurrency usually comes at the cost of transaction serializability.
Jose M. Faleiro, Daniel J. Abadi
openaire +3 more sources
Eventually-serializable data services
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96, 1996 AbstractData replication is used in distributed systems to improve availability, increase throughput and eliminate single points of failures. The cost of replication is that significant care and communication is required to maintain consistency among replicas.
Victor Luchangco +4 more
openaire +3 more sources
An Assertional Characterization of Serializability [PDF]
, 1989 Serializability is usually defined operationally in terms of sequences of operations. This paper gives another definition of serializability-in terms of sequences of states. It also shows how this definition can be used to prove correctness of solutions to the concurrency control problem.
E. R McCurley, Fred B. Schneider
openaire +2 more sources