:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Ramakrishna, Shefali, Peng, Edwin, Scully, Ziv
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Performance Probability
Accesso online:	https://arxiv.org/abs/2605.01522
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
di: Yu, George, et al.
Pubblicazione: (2024)

When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail?
di: Scully, Ziv, et al.
Pubblicazione: (2021)

The Gittins Index: A Design Principle for Decision-Making Under Uncertainty
di: Scully, Ziv, et al.
Pubblicazione: (2025)

Tail Optimality and Performance Analysis of the Nudge*(M) Scheduling Algorithm
di: Charlet, Nils, et al.
Pubblicazione: (2024)

Decision-Epoch Matters: Unveiling its Impact on the Stability of Scheduling with Randomly Varying Connectivity
di: Soprano-Loto, Nahuel, et al.
Pubblicazione: (2024)

Heavy-Traffic Optimal Size- and State-Aware Dispatching
di: Xie, Runhan, et al.
Pubblicazione: (2023)

Experimentation for Different Scheduling Policies on Queues: Mixed Differences-in-Q Estimators Based on Little's Law
di: Jia, Nanshan, et al.
Pubblicazione: (2026)

Flowshop Machine Scheduling: Markov Modeling, Optimal Schedules and Heuristics
di: Ghanem, Samah A. M.
Pubblicazione: (2025)

M|D|$\infty$ Queue Busy Period and Busy Cycle Distributions Computational Calculus
di: Ferreira, Manuel Alberto M.
Pubblicazione: (2025)

On Resolving Non-Preemptivity in Multitask Scheduling: An Optimal Algorithm in Deterministic and Stochastic Worlds
di: Li, Wenxin
Pubblicazione: (2024)

Optimal Scheduling in a Quantum Switch
di: Bhambay, Sanidhay, et al.
Pubblicazione: (2025)

SPLIT: SymPathy for Large jobs Improves Tail latency
di: Li, Zhouzi, et al.
Pubblicazione: (2026)

Tail Bounds for Queues with Abandonment: Constant, Moderate, Large Deviations, and Efficient Concentration
di: Wang, Zedong, et al.
Pubblicazione: (2026)

$γ$-CounterBoost: Optimizing response time tails using job type information only
di: Charlet, Nils, et al.
Pubblicazione: (2026)

Response time in a pair of processor sharing queues with Join-the-Shortest-Queue scheduling
di: Bor, Julianna, et al.
Pubblicazione: (2024)

Efficient scheduling in redundancy systems with general service times
di: Anton, Elene, et al.
Pubblicazione: (2022)

Stability and Optimization of Speculative Queueing Networks
di: Anselmi, Jonatha, et al.
Pubblicazione: (2021)

Optimal local storage policy based on stochastic intensities and its large scale behavior
di: Carrasco, Matias, et al.
Pubblicazione: (2024)

Stability and Heavy-traffic Delay Optimality of General Load Balancing Policies in Heterogeneous Service Systems
di: Luo, Yishun, et al.
Pubblicazione: (2025)

Multiserver-job Response Time under Multilevel Scaling
di: Grosof, Isaac, et al.
Pubblicazione: (2025)

Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload
di: Grosof, Isaac, et al.
Pubblicazione: (2024)

Graph-Based Product Form
di: Comte, Céline, et al.
Pubblicazione: (2025)

Heavy-traffic Optimality of Skip-the-Longest-Queues in Heterogeneous Service Systems
di: Luo, Yishun, et al.
Pubblicazione: (2025)

Local hedging approximately solves Pandora's box problems with nonobligatory inspection
di: Scully, Ziv, et al.
Pubblicazione: (2024)

Analyzing homogenous and heterogeneous multi-server queues via neural networks
di: Sherzer, Eliran
Pubblicazione: (2025)

Stochastic Network Calculus with Localized Application of Martingales
di: Bouillard, Anne
Pubblicazione: (2022)

Scheduling with Uncertain Holding Costs and its Application to Content Moderation
di: Gocmen, Caner, et al.
Pubblicazione: (2025)

Novel Lower Bounds on M/G/k Scheduling
di: Wang, Ziyuan, et al.
Pubblicazione: (2025)

Diffusion approximation error for queueing systems with general primitives
di: Braverman, Anton, et al.
Pubblicazione: (2024)

Stein's method for models with general clocks: A tutorial
di: Braverman, Anton, et al.
Pubblicazione: (2025)

Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
di: Alahyane, Abdelkrim, et al.
Pubblicazione: (2026)

Optimizing Asynchronous Federated Learning: A Delicate Trade-Off Between Model-Parameter Staleness and Update Frequency
di: Alahyane, Abdelkrim, et al.
Pubblicazione: (2025)

Finite-Time Behavior of Erlang-C Model: Mixing Time, Mean Queue Length and Tail Bounds
di: Nguyen, Hoang Huy, et al.
Pubblicazione: (2025)

Score-Aware Policy-Gradient and Performance Guarantees using Local Lyapunov Stability
di: Comte, Céline, et al.
Pubblicazione: (2023)

Faster LLM Inference using DBMS-Inspired Preemption and Cache Replacement Policies
di: Kim, Kyoungmin, et al.
Pubblicazione: (2024)

The Transient Cost of Learning in Queueing Systems
di: Freund, Daniel, et al.
Pubblicazione: (2023)

Derandomized Load Balancing using Random Walks on Expander Graphs
di: Tang, Dengwang, et al.
Pubblicazione: (2019)

Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
di: Anselmi, Jonatha, et al.
Pubblicazione: (2014)

Unleashing the Power of Preemptive Priority-based Scheduling for Real-Time GPU Tasks
di: Wang, Yidi, et al.
Pubblicazione: (2024)

n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer
di: Dai, Wanyang
Pubblicazione: (2021)