A new stochastic load balancing model is introduced that allows for a tradeoff between non-adaptive policies and performance, with results showing a 2-reservation approximation to the omniscient optim…

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

The ZCube topology, which eliminates path multiplicity and reduces switching hardware, delivers better performance for large model training and inference than traditional multipath datacenter networks…

This paper proposes a host-driven method for flowlet balancing using Segment Routing over IPv6 (SRv6), reducing tail latency by 15% and 33% compared to random flowlet balancing and ECMP, respectively.

The paper introduces Spandana, an architecture that decouples SLO enforcement from cost optimization in cloud-based online services, achieving high utilization, strict SLO adherence, and cost savings.

This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.

This paper argues that idle cores on contemporary multicore processors can return compute capacity and proposes a budget-centric view of service core systems.

The paper proposes a method to improve the performance of fine-grained offloads on servers by overlapping the offload with other requests using server-side routing.

This paper proposes a proactive fair scheduling framework to prevent fabric oversubscription and eliminate incast in Mixture of Experts (MoE) architectures, demonstrating consistent link utilization a…

This paper proposes a dependency-aware autoscaling framework for serverless computing, integrating graph-based bottleneck identification, short-term workload forecasting, multi-model consensus, and co…

The I/O Resource Manager (IORM) is presented as a multi-stage distributed scheduler to maintain consistent performance and enforce global I/O limits in shared-nothing disaggregated storage clusters.

The paper introduces EduMPI, a learning support tool for simplifying cluster usage and performance analysis of MPI parallel programs for students.

This paper introduces campaign diagrams, a visualization technique for analyzing resource utilization and identifying bottlenecks in modern workloads.

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.

This paper analyzes data-access cost in a memory hierarchy and shows it scales with the fourth root of data size, predicting scalability.

The Sleator-Tarjan model used in competitive analysis of paging is incorrect, and this error undermines the performance predictions for online paging algorithms.