Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 39 for “"Serializability"”.

  1. Challenges in Verifying Strict Serializability in Distributed Datastores

    Strict serializability or external consistency is considered the gold standard for modern daydistributed datastores ensuring data consistency, reliability, and robustness. While many systems claim to have achieved this using diverse mechanisms, relying solely on such claims can leave the clients …

    buffalo Repository record for Challenges in Verifying Strict Serializability in Distributed Datastores (opens in a new tab)

  2. Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains

    As distributed systems become more federated and cross-domain, we are forced to rethink some of our core abstractions. We need heterogeneous systems with rigorous consistency and self-authentication guarantees, despite a complex landscape of security and failure tolerance assumptions. I have …

    cornell Repository record for Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains (opens in a new tab)

  3. Optimizing Distributed Transactions: Speculative Client Execution, Certified Serializability, and High Performance Run-Time

    … without worrying about synchronization. texttt{Serializability} is the de-facto standard form of isolation required by transactions for many applications. The existing methods employed by DBMSs to enforce serializability employ explicit fine-grained locking. The eager-locking based approach is …

    vt Repository record for Optimizing Distributed Transactions: Speculative Client Execution, Certified Serializability, and High Performance Run-Time (opens in a new tab)

  4. On Improving Distributed Pregel-like Graph Processing Systems

    … of support for graph algorithms that require serializability, the guarantee that parallel executions of an algorithm produce the same results as some serial execution of that algorithm. Many graph processing systems use the bulk synchronous parallel (BSP) model, which allows graph algorithms …

    waterloo Repository record for On Improving Distributed Pregel-like Graph Processing Systems (opens in a new tab)

  5. Efficient Partitioning and Allocation of Data for Workflow Compositions

    … appropriate data nodes. Our approach guarantees serializability and efficient execution. In Phase 1, we cluster transactions based on data requirements. We associate each cluster with an abstract query definition. An abstract query represents the minimal data requirement that would satisfy all …

    south-carolina Repository record for Efficient Partitioning and Allocation of Data for Workflow Compositions (opens in a new tab)

  6. Youtopia: A Community Database Management System

    … interference. We provide a suitable definition of serializability for the Youtopia transaction model and present an algorithm framework that can be used to enforce it. We illustrate our framework with an extended case study that includes experimental results from the implementation of our …

    cornell Repository record for Youtopia: A Community Database Management System (opens in a new tab)

  7. Transaction management in peer-to-peer multidatabase systems

    … attributes in two acquainted peers. We present a serializability theory for transactions in P2P MDBSs, and then a concurrency control protocol is proposed to ensure the global serializability of global histories by controlling the consistency over each single acquaintance. The correctness of the …

    ottawa-retro Repository record for Transaction management in peer-to-peer multidatabase systems (opens in a new tab)

  8. Transaction management in mobile multidatabases.

    … global transactions. This algorithm verifies the serializability of a global transaction by constructing a partial global serialization graph. This algorithm relies on the propagation of (serialization) information to ensure that the partial graph contains sufficient information to verify …

    oklahoma-thes Repository record for Transaction management in mobile multidatabases. (opens in a new tab)

  9. EIT: Escalonador Inteligente de Transações

    … criteria, such as conventional (syntactic) serializability and semantic serializability. In order to evaluate the performance of the ITS in relation to others schedulers with exclusively aggressive or conservative behavior, it was applied in a dynamic environment, such as a Mobile Database …

    brazil-ufrn Repository record for EIT: Escalonador Inteligente de Transações (opens in a new tab)

  10. ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ

    … THESIS WE INTRODUCE A NEW NOTION OF MULTIVERSION SERIALIZABILITY (MVSR) BASED ON CONFLICTS (MVCSR) AND DISCUSS ITS RELATION WITH THE WELL KNOWN SINGLE VERSION CONFLICT SERIALIZABILITY (CSR). WE PROVE THAT IT IS NP-COMPLETE TO DECIDE WHETHER A SET OF SCHEDULES IS ON-LINE SCHEDULABLE (OLS). WE …

    greece Repository record for ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ (opens in a new tab)

  11. Conflict -aware replication for dynamic content Web sites

    … provides both throughput scaling and 1-copy serializability. It has generally been believed that this combination is hard to achieve through replication because of the growth of the number of conflicts. Conflict-aware replication interposes a (possibly replicated) scheduler between the …

    rice Repository record for Conflict -aware replication for dynamic content Web sites (opens in a new tab)

  12. IRON: Internalizing Real-Time Ordering to Verify Strictly Serializable Databases

    … explores the challenges of verifying strict serializability in distributed databases, which are complicated by the inherent limitation of physical clocks and network latencies. These challenges prevent reliable verification of transaction orders across different nodes of the database. …

    buffalo Repository record for IRON: Internalizing Real-Time Ordering to Verify Strictly Serializable Databases (opens in a new tab)

  13. Formal Verification of the Correctness of Software Transactional Memory

    … significance, extending the notion of strict serializability from database transactions. Our analysis critically evaluates Guerraoui et al.'s initial work in STM correctness, particularly their reduction theorem for strict serializability and opacity. We identify limitations in their approach, …

    anu Repository record for Formal Verification of the Correctness of Software Transactional Memory (opens in a new tab)

  14. Transaction and data consistency models for cloud applications

    … we investigate two approaches for ensuring serializability. We perform a comparative evaluation of the two architectures and approaches for guaranteeing serializability and demonstrate their scalability. For transaction management in geo-replicated systems, we propose an SI based transaction …

    umn Repository record for Transaction and data consistency models for cloud applications (opens in a new tab)

  15. A categorization scheme for concurrency control protocols in distributed databases

    … scheme is based on the theoretical concept of serializability, but is qualitative in nature. An important class of serializable execution sequences, conflict-preserving-serializable, leads to the identification of fundamental attributes common to all algorithms included in this study. These …

    iastate Repository record for A categorization scheme for concurrency control protocols in distributed databases (opens in a new tab)

  16. Strong Memory Consistency For Parallel Programming

    … and hardware-supported systems that provide OFR serializability.

    penn Repository record for Strong Memory Consistency For Parallel Programming (opens in a new tab)

  17. Modeling Concurrency with Interval Traces

    … step sequences with appropriate simultaneity and serializability relations. Unfortunately, both of them are unable to clearly describe the abstract interval order semantics of inhibitor nets. The goal of the thesis is to provide a monoid based model called Interval Traces that would allow a single …

    mcmaster Repository record for Modeling Concurrency with Interval Traces (opens in a new tab)

  18. A performance study of the concurrency control algorithms in hierarchical network with partitioned database

    … integrity of the distributed database and the serializability of concurrent updates. This thesis is the first to investigate the performance in hierarchical networks of two widely-cited concurrency control mechanisms, locking based and timestamp. Various parameters are investigated in our …

    nps Repository record for A performance study of the concurrency control algorithms in hierarchical network with partitioned database (opens in a new tab)

  19. Executable Denotational Semantics With Interaction Trees

    … the notions of linearizability and strict serializability, two well-known correctness conditions for concurrent objects.

    penn Repository record for Executable Denotational Semantics With Interaction Trees (opens in a new tab)

Page 1 of 2