Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Dmytro Dziuma

dblp:147/3349 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 62% Parallel and multicore computing · 38%
Theoretical computer science
1 paper
Distributed computing theory · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
consistency conditions		 0.412019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
Parallel and multicore computing
transactional memory		 0.412019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
Distributed computing theory
impossibility results		 0.412019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
Distributed computing theory
transactional memory		 0.412019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
Distributed systems
concurrency control		 0.112019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
Distributed systems › distributed computing theory
liveness		 0.112019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live · J. ACM 2019
YearPublicationVenuePosition
2019 The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live
abstract
We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism , i.e., transactions do not need to synchronize unless they access the same application objects, (2) very little consistency , i.e., a consistency condition, called weak adaptive consistency , introduced here and that is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and (3) very little liveness , i.e., which transactions eventually commit if they run solo.
Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui
 J. ACM2
2014 The PCL theorem: transactions cannot be parallel, consistent and live
abstract
We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condition, called weak adaptive consistency, introduced here and which is weaker than snapshot isolation, processor consistency, and any other consistency condition stronger than them (such as opacity, serializability, causal serializability, etc.), and very little liveness, i.e. that transactions eventually commit if they run solo.
Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui
 SPAA2