20 results for “Understanding of scheduling algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
One clear sentence describing what this paper does
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 studies the complexity of Value-based Task Selection (VTS) in real-time systems.
The paper presents a benchmark platform for evaluating controllers for continuous multi-mode scheduling in edge-cloud continua.
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…
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…
Weinan Liu, Zeyuan Ding, Dian Ding, Chengcheng Wan +4 more
This paper presents SliceScheduler, a dynamic operator-level scheduling system for multi-tenant model serving that improves GPU utilization and maintains SLA.
This paper provides a counterexample to a previous schedulability test and shows it is unsound.
The paper implements and evaluates several hardware priority queue architectures on modern FPGA platforms and provides a quantitative analysis.
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…
The paper proposes a conservative extension of Lustre's clock calculus to facilitate the embedding of ML models in reactive applications.
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.