Cover Image

Conflict-Freedom as a Progress Condition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kuznetsov, Petr, Sutra, Pierre, Toyos-Marfurt, Guillermo
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing F.1.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Pending Conflicts Make Progress Impossible
by: Kuznetsov, Petr, et al.
Published: (2026)

Space-Time Trade-off in Bounded Iterated Memory
by: Toyos-Marfurt, Guillermo, et al.
Published: (2025)

On the Bit Complexity of Iterated Memory
by: Toyos-Marfurt, Guillermo, et al.
Published: (2024)

Adjusted Objects: An Efficient and Principled Approach to Scalable Programming (Extended Version)
by: Kane, Boubacar, et al.
Published: (2025)

Decidability Issues for Petri Nets -- a survey
by: Esparza, Javier, et al.
Published: (2024)

Resolving Conflicts with Grace: Dynamically Concurrent Universality
by: Kuznetsov, Petr, et al.
Published: (2025)

Making Democracy Work: Fixing and Simplifying Egalitarian Paxos (Extended Version)
by: Ryabinin, Fedor, et al.
Published: (2025)

Revisiting Lower Bounds for Two-Step Consensus
by: Ryabinin, Fedor, et al.
Published: (2025)

Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication
by: Gianinazzi, Lukas, et al.
Published: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
by: Gupta, Chetan, et al.
Published: (2024)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Resource Heterogeneity-Aware and Utilization-Enhanced Scheduling for Deep Learning Clusters
by: Sultana, Abeda, et al.
Published: (2025)

Generic Multicast (Extended Version)
by: Bolina, José Augusto, et al.
Published: (2024)

Global Optimizations & Lightweight Dynamic Logic for Concurrency
by: Pati, Suchita, et al.
Published: (2024)

Supercomputers as a Continous Medium
by: Karp, Martin, et al.
Published: (2024)

Towards Communication-Efficient Peer-to-Peer Networks
by: Hourani, Khalid, et al.
Published: (2024)

The consensus number of a shift register equals its width
by: Aspnes, James
Published: (2025)

Computational Power of Opaque Robots
by: Feletti, Caterina, et al.
Published: (2024)

Sublinear-Time Sampling of Spanning Trees in the Congested Clique
by: Pemmaraju, Sriram V., et al.
Published: (2024)

Obfuscated Consensus
by: Aspnes, James, et al.
Published: (2025)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
by: Attiya, Hagit, et al.
Published: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2024)

An Analysis of Avalanche Consensus
by: Amores-Sesar, Ignacio, et al.
Published: (2024)

Wait-free Replicated Data Types and Fair Reconciliation
by: Kuznetsov, Petr, et al.
Published: (2025)

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
by: Hirose, Jion, et al.
Published: (2025)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
by: Lingas, Andrzej
Published: (2024)

Asynchronous Latency and Fast Atomic Snapshot
by: Bezerra, João Paulo, et al.
Published: (2024)

Near-Optimal Wafer-Scale Reduce
by: Luczynski, Piotr, et al.
Published: (2024)

A Sufficient Epistemic Condition for Solving Stabilizing Agreement
by: Cignarale, Giorgio, et al.
Published: (2024)

PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
by: Suzuki, Kengo, et al.
Published: (2026)

Dynamic Probabilistic Reliable Broadcast
by: Anikina, Veronika, et al.
Published: (2023)

Distributed Rhombus Formation of Sliding Squares
by: Kostitsyna, Irina, et al.
Published: (2025)

DAGs for the Masses
by: Anoprenko, Michael, et al.
Published: (2025)

Relaxation for Efficient Asynchronous Queues
by: Baldwin, Samuel, et al.
Published: (2025)

Quality Control in Open-Ended Crowdsourcing: A Survey
by: Chai, Lei, et al.
Published: (2024)

Clock Synchronization Is Almost Impossible with Bounded Memory
by: Charron-Bost, Bernadette, et al.
Published: (2024)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

Graded modal logic and counting message passing automata
by: Ahvonen, Veeti, et al.
Published: (2024)

FedMon: Federated eBPF Monitoring for Distributed Anomaly Detection in Multi-Cluster Cloud Environments
by: Zehra, Sehar, et al.
Published: (2025)