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

20 results for “Understanding of scheduling algorithms”

CS papers only

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

Want pure semantic search? Try claim verification →

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.DSEmpiricalRecentJun 23, 2026

Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model

Felix Buld, Andreas S. Schulz

One clear sentence describing what this paper does

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.CCcs.DSTheoreticalRecentOct 26, 2026

The Complexity of Value Optimization in Sporadic Task Systems

Christopher Harbourne, Nathan Fisher, Kecheng Yang, Pontus Ekberg +2 more

This paper studies the complexity of Value-based Task Selection (VTS) in real-time systems.

View →
cs.DCEmpiricalRecentJun 10, 2026

Fair Comparison of Scheduling Algorithms on Heterogeneous Edge Clusters: A Continuous Adaptive Benchmark

Zihang Wang, Boris Sedlak, Juan Luis Herrera, Schahram Dustdar

The paper presents a benchmark platform for evaluating controllers for continuous multi-mode scheduling in edge-cloud continua.

View →
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.DCEmpiricalRecentJul 2, 2026

Elasticity in Parallel Sparse Triangular Solve

Raphael S. Steiner, Christos K. Matzoros, Pál András Papp, Toni Böhnlein +1 more

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…

View →
cs.OScs.DCcs.LGEmpiricalRecentAug 16, 2026

Global Simulation-Guided Dynamic Operator Scheduling for Efficient Multi-Tenant Model Serving

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.

View →
cs.OSTheoreticalRecentOct 19, 2026

Comments Paper: Counterexample for Schedulability Analysis for Self-Suspending Tasks under EDF-Like Scheduling

Michael Frichert, Mario Günzel, Marion Sudvarg, Jian-Jia Chen

This paper provides a counterexample to a previous schedulability test and shows it is unsound.

View →
cs.AREmpiricalRecentJul 22, 2026

Revisiting Hardware Priority Queue Architectures

Qihang Wu, Austin Rovinski

The paper implements and evaluates several hardware priority queue architectures on modern FPGA platforms and provides a quantitative analysis.

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
cs.DMTheoreticalRecentJul 3, 2026

Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility

Robert Bredereck, Till Fluschnik, Klaus Heeger

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…

View →
cs.PLcs.LGTheoreticalRecentJul 23, 2026

Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling

William Gaudelier, Albert Cohen, Dumitru Potop Butucaru

The paper proposes a conservative extension of Lustre's clock calculus to facilitate the embedding of ML models in reactive applications.

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

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.

View →