Jul 2026· International Conference on Computer Communications and Networks· pp. 1-9· 1 citation· 18 references
Abstract
Modern databases must serve highly variable workloads: short queries that demand low latency and long-running tasks that consume significant resources. Under heavy load, these workloads risk spiraling into metastability, a self-sustaining state of degraded throughput and high latency that persists even after the initial stressor is removed. In this paper, we investigate the design of an Execution Control System (ECS) specifically engineered for metastability resilience.To explore this design space, we developed MESSI, a discrete-event simulator implemented in Go that enables us to replay stress scenarios, visualize the formation of metastable feedback loops, and quantify resource allocation trade-offs. By representing systems as a graph of Logic Nodes and Processors, MESSI captures queueing dynamics, I/O delays, and retry policies at a fine grained level. Our research highlights how conventional management policies can inadvertently trigger metastable failures and demonstrates that principled load shedding and bounded concurrency (via a ticket-based abstraction) are essential for maintaining responsiveness. Our findings provide a roadmap for building performant and predictable ECS that explicitly operate within a safe resilient envelope even under dynamically shifting workloads.
This paper examines two production-documented architectures that fold detection, decision, verification, and staged deployment into one closed loop, one built for continuous security enforcement and the other for continuous performance optimization, and asks whether the integration amounts to a genuine architectural ad...
Daniil Sergeevich Martynov· American Journal of Interdis...· 0 citations
A novel finite-state modelling strategy is introduced that preserves essential Storm behaviour, including nondeterministic outputs and timed processing, while abstracting indistinguishable tuples and threads into counters and advancing time by sound leaps between relevant events.
E. Pagani, M. Bersani, Mădălina Erașcu et al.· 0 citations
This work shows how higher-order combinators solve higher-order problems of asynchronous calls to a network service, database, or language model uniformly, including timeouts, retries, rate limiting, caching, reentrant locking, and cancellation.
Procurator is a verification framework that efficiently captures interactive behaviors in distributed in-network programs and employs an intermediate representation (IR) pruner to reduce the execution space and a schedule-replay-based acceleration approach to avoid explicit exploration of long execution traces.
Mingyuan Song, Huan-Xing Shen, Jinghui Jiang et al.· Conference on Applications,...· 0 citations
Fugue is a novel, self-contained reactive protocol that provides seamless and resource-efficient elasticity and reaches comparable handover performance while avoiding continuous replication overhead, and is implemented in Apache Flink.
Yu-Qiu Zhang, Yun-Hao Mao, Hans-Arno Jacobsen· Proceedings of the VLDB Endo...· 0 citations
This work asks whether a Large Language Model can replace the static routing policy itself, reading HAProxy and Prometheus telemetry every 10 seconds and isolating faulty servers through guardrailed calls to the HAProxy Data Plane API.
A. Chauhan, Vishnu S Pendyala· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.