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
Secure Password Storage: Why Applications Should Never Store Plain-Text Passwords
0dev.to OpenSource
Perplexity Decider v1.3 Open Weights Beat Jev 1.14
0dev.to OpenSource
I Measured My MCP Server's Context Tax Before Adding a Third Tool
0dev.to OpenSource

Let your coding agent test the API it just wrote
0dev.to OpenSource

Inside Stripe’s AI Coding Interview: Rule Engines, AI Prompts, and Tests
0dev.to Programming
From Idea to Wireframe to Production Design: An Open-Source Product Blueprint Guide
0dev.to Programming