🤖 AI Summary
Metadata hotspots constitute a critical bottleneck limiting I/O scalability in HPC and cloud storage systems, often triggered by job launches or checkpoint storms that induce server-level request surges, thereby exacerbating tail latency and degrading throughput. This paper proposes a transparent middleware deployed between clients and metadata servers—requiring no kernel or backend modifications. Its core contributions are threefold: (1) namespace-aware dynamic load balancing, leveraging an enhanced power-of-d sampling strategy; (2) semantics-preserving collaborative caching, enforced via a lease-driven consistency protocol; and (3) an anti-oscillation, self-stabilizing control loop that enables real-time, telemetry-driven adaptation of timeouts and routing policies. Experimental evaluation demonstrates that, compared to round-robin scheduling, the approach reduces average queue length by 23% and mitigates worst-case hotspots by up to 80%, significantly improving both aggregate throughput and tail-latency predictability.
📝 Abstract
Metadata hotspots remain one of the key obstacles to scalable Input/Output (I/O) in both High-Performance Computing (HPC) and cloud-scale storage environments. Situations such as job start-ups, checkpoint storms, or heavily skewed namespace access can trigger thousands of concurrent metadata requests against a small subset of servers. The result is long queues, inflated tail latencies, and reduced system throughput. Prior efforts including static namespace partitioning, backend-specific extensions, and kernel-level modifications address parts of the problem, but they often prove too rigid, intrusive to deploy, or unstable under shifting workloads. We present MIDAS, an adaptive middleware layer that operates transparently between clients and metadata servers, requiring no changes to kernels or storage backends. The design brings together three mechanisms: (i) a namespace-aware load balancer that enhances consistent hashing with power-of-d sampling informed by live telemetry, (ii) a cooperative caching layer that preserves backend semantics through leases, invalidations, or adaptive timeouts, and (iii) a self-stabilizing control loop that dynamically adjusts routing aggressiveness and cache lifetimes while avoiding oscillations under bursty workloads. Analysis of the model and controlled experiments show that MIDAS reduces average queue lengths by roughly 23% and mitigates worst-case hotspots by up to 80% when compared to round-robin scheduling. These findings highlight that a stability-aware, middleware-based strategy can provide backend-agnostic improvements to metadata management, enabling better scalability in bursty scenarios, more predictable tail latencies, and stronger overall system performance.