Open problems in queueing theory inspired by datacenter computing
From MaRDI portal
Publication:2052428
Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
Cites work
- A unified framework for numerically inverting Laplace transforms
- A Wiener-Hopf based approach to numerical computations in fluctuation theory for Lévy processes
- An M/M/2-parallel system model with pure space sharing among rigid jobs
- An introduction to heavy-tailed and subexponential distributions
- Appendix: A primer on heavy-tailed distributions
- Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Bandwidth sharing and admission control for elastic traffic
- Blocking of finite source inputs which require simultaneous servers with general think and holding times
- Computation and optimization methods for multiresource queues
- Delay asymptotics and bounds for multitask parallel jobs
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
- Generalized Erlang problem for service systems with finite total capacity
- Heavy tails in multi-server queue
- scientific article; zbMATH DE number 3950178 (Why is no real title available?)
- scientific article; zbMATH DE number 3630213 (Why is no real title available?)
- scientific article; zbMATH DE number 1969704 (Why is no real title available?)
- scientific article; zbMATH DE number 1559527 (Why is no real title available?)
- scientific article; zbMATH DE number 1424149 (Why is no real title available?)
- scientific article; zbMATH DE number 6765483 (Why is no real title available?)
- scientific article; zbMATH DE number 3084689 (Why is no real title available?)
- Large loss networks
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
- NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
- Oblivious algorithms for multicores and networks of processors
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
- On stochastic bounds for monotonic processor sharing networks
- On the Gittins index in the M/G/1 queue
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance analysis and optimization of multi-traffic on communication networks.
- Performance modeling and design of computer systems. Queueing theory in action
- Poisson hail on a hot ground
- Power law condition for stability of Poisson hail
- Properties of the Gittins index with application to optimal scheduling
- Provably efficient scheduling for languages with fine-grained parallelism
- Queueing with redundant requests: exact analysis
- Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
- Redundancy scheduling with scaled Bernoulli service requirements
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Scheduling multithreaded computations by work stealing
- Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
- Scheduling parallelizable jobs online to maximize throughput
- Scheduling threads for low space requirement and good locality
- Size- and state-aware dispatching problem with queue-specific job sizes
- Sojourn time asymptotics in processor-sharing queues
- Stability analysis of a multi-server model with simultaneous service and a regenerative input flow
- 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
- Stability criterion of a multiserver model with simultaneous service
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- Task assignment with unknown duration
- The Accurate Numerical Inversion of Laplace Transforms
- The data locality of work stealing
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- The Markovian Queue with Bounded Waiting time
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Thread scheduling for multiprogrammed multiprocessors
- Understanding the Efficiency of Multi-Server Service Systems
- Waiting-time asymptotics for the M/G/2 queue with heterogeneous servers
- Waiting-time tail probabilities in queues with long-tail service-time distributions
Cited in
(13)- Delay performance of data-center queue with setup policy and abandonment
- scientific article; zbMATH DE number 7042502 (Why is no real title available?)
- Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
- Data Center Scheduling, Generalized Flows, and Submodularity
- 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
- Core allocation to minimize total flow time in a multicore system in the presence of a processing time constraint
- Numerical analysis of the applications number characteristics of queuing systems with diffusive input flow intensity
- Discrete-time informal queue with an infinite number of groups for resource management of a data center
- An approximate bribe queueing model for bid advising in cloud spot markets
This page was built for publication: Open problems in queueing theory inspired by datacenter computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052428)
