20 results for “Distributed systems”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…
This paper explores using Conflict-free Replicated Data Types (CRDTs) for dynamic software updates in distributed applications.
This paper provides a systematic survey of ROS 2 middleware and identifies architectural limits through three dimensions: Space, Time, and State.
This paper presents an automated verification technique for safety properties of affine distributed protocols with an unbounded number of actors.
The paper proposes the bi-channel paradigm for database systems to improve performance by separating communication into two channels.
The paper proposes a probabilistic off-tree forwarding mechanism to reduce latency in large-scale distributed systems.
This paper introduces DiStash, a disaggregated transactional key-value store that enables an application to use a single transaction to manage key-value pairs across different pools of stashes, preven…
Xinwei Qiang, Yifan Hu, Shixuan Sun, Jing Yang +5 more
GF-DiT: A policy-programmable runtime for elastic DiT serving
This paper introduces Selective Field Transmission (SFT), a mechanism that dynamically adapts transmitted message components to each receiver's needs in publish-subscribe systems, achieving significan…
This paper proposes a methodology for identifying suitable urban locations for deploying distributed servers under urban constraints.
This paper proposes a neighbor-only work stealing strategy for Asynchronous Many-Task runtimes in Space Edge Computing.
This paper presents a practical MPI malleability methodology for HPC clusters.
This paper presents a software ecosystem enabling consistent development environments for running workflows across diverse hardware platforms.
This paper introduces the Scatter-Gather parallel-programming and parallel-execution model in the form of a simple imperative language.
This paper develops distributive laws for parallel composition in a rely/guarantee style theory for reasoning about concurrent programs.