Backend
Properties of Concurrent Algorithms that Allow Asynchrony
arXiv cs.DC0 views
arXiv:2302.14834v4 Announce Type: replace-cross Abstract: In this paper, we investigate the conditions under which a concurrent system is able to guarantee convergence deterministically even without synchronization. In general, an algorithm is deemed asynchrony-tolerant iff the global states form a DAG even if the nodes can execute based on outdated/stale values from each other. In this paper, we show that the induction of a partial order (PO) among the local states visited by individual nodes is necessary and sufficient to allow asynchrony. There are certain problems for which the predicate that defines the problem, itself, induces a partial order among the local states (called \textit{PO-inducing problems}). On the other hand, \textit{non-PO-inducing problems} is another class of problems in which a predicate defining the problem cannot induce a partial order among local states. We introduce these classes of problems. We study example PO-inducing and non-PO-inducing problems, and provide example PO-inducing (in other words, asynchrony-tolerant) algorithms (algorithms under which any node traverses a partial order of local states) for all these problems.
Source:https://arxiv.org/abs/2302.14834PreviousTriple Overlap in Pipelined Krylov Methods on Multi-GPU SystemsNextAchieving Near-Zero-Overhead Multi-Model Hierarchical Classification in Real-Time Detection Pipelines
Related posts

PostgreSQL 19 removes the MultiXact members wall. Reclamation still waits for template0.
0dev.to
Hugging Face Breach: Security Lessons for AI Agents
0dev.to
Incus Project and Migration Trust Boundaries Need Separate Review
0dev.to

Next.js `revalidatePath` vs `revalidateTag` in 2026: Choosing the Right Cache Invalidation Primitive at Scale
0dev.to

'python' Is Not Recognized as an Internal or External Command: Every Fix
0dev.to

Xcode Instruments in Practice: Profiling and Optimizing iOS Apps
0dev.to