English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Data replication technologies enable efficient and highly-available dataaccess, thus gaining more and more interests in both the academia and theindustry. However, data replication introduces the problem of data consistency.Modern commercial data replication systems often provide weak consistency forhigh availability under certain failure scenarios. An important weakconsistency is Pipelined-RAM (PRAM) consistency. It allows different processesto hold different views of data. To determine whether a data replication systemindeed provides PRAM consistency, we study the problem of Verifying PRAMConsistency over read/write traces (or VPC, for short).  We first identify four variants of VPC according to a) whether there areMultiple shared variables (or one Single variable), and b) whether writeoperations can assign Duplicate values (or only Unique values) for each sharedvariable; the four variants are labeled VPC-SU, VPC-MU, VPC-SD, and VPC-MD.Second, we present a simple VPC-MU algorithm, called RW-CLOSURE. It constructsan operation graph $\mathcal{G}$ by iteratively adding edges according to threerules. Its time complexity is $O(n^5)$, where n is the number of operations inthe trace. Third, we present an improved VPC-MU algorithm, called READ-CENTRIC,with time complexity $O(n^4)$. Basically it attempts to construct the operationgraph $\mathcal{G}$ in an incremental and efficient way. Its correctness isbased on that of RW-CLOSURE. Finally, we prove that VPC-SD (so is VPC-MD) is$\sf{NP}$-complete by reducing the strongly $\sf{NP}$-complete problem3-PARTITION to it.

Verifying PRAM Consistency over Read/Write Traces of Data Replicas