ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “stochastic load balancing”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DScs.DMTheoreticalRecentJul 28, 2026

Stochastic Load Balancing with Machine Reservations

David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver +1 more

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…

View →
cs.DCEmpiricalRecentJun 29, 2026

Spandana: Reconciling Strict SLOs with Low Cost under Fine-Grained Load Fluctuations

Dilina Dehigama, Shyam Jesalpura, Zeyu Xu, Marton Nemeth +3 more

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.

View →
cs.LGcs.AIcs.DCEmpiricalRecentJul 16, 2026

An Auto-Scaling Approach for Serverless Environments Based on a Multi-Expert Consensus Mechanism

Mobina Kashaniyan, Mehrdad Ashtiani, Amirhossein Ghassemi

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…

View →
cs.OScs.ARcs.NIEmpiricalRecentJul 17, 2026

Rethinking Polling Efficiency in Service Core Network Stacks

Matheus Stolet, Simon Peter, Antoine Kaufmann

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

View →
cs.DCcs.DSEmpiricalRecentJun 27, 2026

Concurrent Splay-Based Tree

Vitaly Aksenov, Rene van Bevern, Artem Shilkin

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.

View →
cs.NIcs.DCcs.LGEmpiricalRecentJul 28, 2026

Incast-Free MoE Rate-Based Scheduling

Evyatar Cohen, Jose Yallouz, Alexander Shpiner, Mark Silberstein +2 more

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…

View →
cs.NIEmpiricalRecentJul 24, 2026

Fewer Paths, Better Performance: Understanding the ZCube Topology through Braess's Paradox

Li Chen

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…

View →
cs.NIEmpiricalRecentJun 26, 2026

Host-Driven Flowlet Balancing with Segment Routing over IPv6

Ryo Nakamura, Hiroki Kano, Tomoko Okuzawa

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.

View →
cs.DSTheoreticalRecentJul 17, 2026

Revisiting Real-Time Interval and Throughput Maximization

Allan Borodin, Changdao He, Nadim Mottu

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.

View →
cs.DCcs.OScs.PFEmpiricalRecentJul 18, 2026

Hardware-Transparent I/O Governance in Disaggregated Heterogeneous Storage

Rajarshi Chowdhury, Akshay Shah, Sue K. Lee

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.

View →
cs.LGcs.AIRecentMay 31, 2026

Beyond Task-Agnostic: Task-Aware Grouping for Communication-Efficient Multi-Task MoE Inference

Zhiyao Xu, Aoxue Liu, Zhanjie Ding, Dan Zhao +2 more

The paper proposes Task-Aware Coactivation Grouping (TACG) to significantly reduce communication costs in multi-task MoE inference by grouping experts based on task-specific co-activation patterns, ou…

View →
cs.PFcs.DCcs.OSEmpiricalRecentJun 22, 2026

LMS-AR: LMS Prediction-based Adaptive Regulator for Memory Bandwidth in Multicore Systems

Sudarshan Srinivasan, Deepak Gangadharan, Dip Goswami

This paper proposes LMS-AR, a memory bandwidth regulation mechanism for multi-core systems using a Linux kernel module with adaptive filtering for prediction and regulation.

View →
cs.MAcs.ROEmpiricalRecentJul 16, 2026

Stigmergic Graph Memory: An Environment-Aware Approach for Many-to-Many Multi-Agent Pickup and Delivery

Aditya Dutta, Joon-Seok Kim

This paper introduces Stigmergic Graph Memory (SGM), a method to improve warehouse throughput in many-to-many Multi-Agent Pickup and Delivery (MAPD) by using a bounded, decaying memory layer to record…

View →