Open problems in queueing theory inspired by datacenter computing
From MaRDI portal
Publication:2052428
DOI10.1007/S11134-020-09684-6zbMath1475.60181OpenAlexW3122299768MaRDI QIDQ2052428
Publication date: 26 November 2021
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-020-09684-6
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (7)
An approximate bribe queueing model for bid advising in cloud spot markets ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ OPERATOR ANALYSIS OF KOLMOGOROV–CHAPMAN TYPE EQUATIONS WITH DIFFERENTIAL OPERATOR ⋮ Three-level modeling of a speed-scaling supercomputer ⋮ Fork-join and redundancy systems with heavy-tailed job sizes ⋮ Analysis of a queueing system with mixed service discipline
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability criterion of a multiserver model with simultaneous service
- Queueing with redundant requests: exact analysis
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- Size- and state-aware dispatching problem with queue-specific job sizes
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Oblivious algorithms for multicores and networks of processors
- An \(M/M/2\)-parallel system model with pure space sharing among rigid jobs
- Blocking of finite source inputs which require simultaneous servers with general think and holding times
- Waiting-time tail probabilities in queues with long-tail service-time distributions
- Large loss networks
- Computation and optimization methods for multiresource queues
- Scheduling threads for low space requirement and good locality
- Power law condition for stability of Poisson hail
- The data locality of work stealing
- Bandwidth sharing and admission control for elastic traffic
- On stochastic bounds for monotonic processor sharing networks
- Appendix: A primer on heavy-tailed distributions
- Stability analysis of a multi-server model with simultaneous service and a regenerative input flow
- On the Gittins index in the M/G/1 queue
- Redundancy scheduling with scaled Bernoulli service requirements
- Scheduling parallelizable jobs online to maximize throughput
- Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks
- Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers
- Delay asymptotics and bounds for multitask parallel jobs
- A Wiener-Hopf based approach to numerical computations in fluctuation theory for Lévy processes
- Generalized Erlang problem for service systems with finite total capacity
- Heavy tails in multi-server queue
- Sojourn time asymptotics in processor-sharing queues
- A Unified Framework for Numerically Inverting Laplace Transforms
- Multi‐Armed Bandit Allocation Indices
- Poisson hail on a hot ground
- PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
- Provably efficient scheduling for languages with fine-grained parallelism
- Scheduling multithreaded computations by work stealing
- Task assignment with unknown duration
- Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
- Understanding the Efficiency of Multi-Server Service Systems
- The Markovian Queue with Bounded Waiting time
- The Accurate Numerical Inversion of Laplace Transforms
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Introduction to Queueing
- An Introduction to Heavy-Tailed and Subexponential Distributions
- Performance Analysis and Optimization of Multi-Traffic on Communication Networks
- NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
- Redundancy-d: The Power of d Choices for Redundancy
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Thread scheduling for multiprogrammed multiprocessors
- Waiting-time asymptotics for the M/G/2 queue with heterogeneous servers
This page was built for publication: Open problems in queueing theory inspired by datacenter computing
