Open problems in queueing theory inspired by datacenter computing
type: Item
instance of: scholarly article
title: Open problems in queueing theory inspired by datacenter computing
zbMATH Open document ID: 1475.60181
author: Mor Harchol-Balter
published in: Queueing Systems
publication date: 2021-11-26T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60K30
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 7433968
zbMATH Keywords: cloud computing
zbMATH Keywords: tail probabilities
zbMATH Keywords: speedup curve
zbMATH Keywords: parallel scheduling
zbMATH Keywords: multi-core
zbMATH Keywords: heavy tails
describes a project that uses: Cilk
describes a project that uses: MapReduce
describes a project that uses: PARSEC
describes a project that uses: TensorFlow
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s11134-020-09684-6
OpenAlex ID: W3122299768
cites work: On the Gittins index in the M/G/1 queue
cites work: PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING
cites work: Asymptotics for steady-state tail probabilities in structured markov queueing models
cites work: Waiting-time tail probabilities in queues with long-tail service-time distributions
cites work: Q4945342
cites work: A unified framework for numerically inverting Laplace transforms
cites work: The data locality of work stealing
cites work: Stability analysis of a multi-server model with simultaneous service and a regenerative input flow
cites work: Stability conditions for a multiserver queueing system with a regenerative input flow and simultaneous service of a customer by a random number of servers
cites work: Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
cites work: Scheduling parallelizable jobs online to maximize throughput
cites work: Thread scheduling for multiprogrammed multiprocessors
cites work: Q4191599
cites work: Poisson hail on a hot ground
cites work: The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
cites work: Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
cites work: Q4422990
cites work: Provably efficient scheduling for languages with fine-grained parallelism
cites work: Scheduling multithreaded computations by work stealing
cites work: On stochastic bounds for monotonic processor sharing networks
cites work: Sojourn time asymptotics in processor-sharing queues
cites work: Waiting-time asymptotics for the M/G/2 queue with heterogeneous servers
cites work: Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
cites work: Oblivious algorithms for multicores and networks of processors
cites work: NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
cites work: A Wiener-Hopf based approach to numerical computations in fluctuation theory for Lévy processes
cites work: Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
cites work: An \(M/M/2\)-parallel system model with pure space sharing among rigid jobs
cites work: Power law condition for stability of Poisson hail
cites work: Heavy tails in multi-server queue
cites work: An Introduction to Heavy-Tailed and Subexponential Distributions
cites work: Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
cites work: Redundancy-d: The Power of d Choices for Redundancy
cites work: Queueing with redundant requests: exact analysis
cites work: The Markovian Queue with Bounded Waiting time
cites work: Multi‐Armed Bandit Allocation Indices
cites work: Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Task assignment with unknown duration
cites work: Introduction to Queueing
cites work: Large loss networks
cites work: Size- and state-aware dispatching problem with queue-specific job sizes
cites work: Q5347955
cites work: Q4526975
cites work: Bandwidth sharing and admission control for elastic traffic
cites work: Computation and optimization methods for multiresource queues
cites work: Scheduling threads for low space requirement and good locality
cites work: Performance Analysis and Optimization of Multi-Traffic on Communication Networks
cites work: Redundancy scheduling with scaled Bernoulli service requirements
cites work: Stochastic bounds in Fork-Join queueing systems under full and partial mapping
cites work: Stability criterion of a multiserver model with simultaneous service
cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: The Queue M/G/1 with the Shortest Remaining Processing Time Discipline

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Appendix: A primer on heavy-tailed distributions

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Q5821541

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: The Accurate Numerical Inversion of Laplace Transforms

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Generalized Erlang problem for service systems with finite total capacity

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Blocking of finite source inputs which require simultaneous servers with general think and holding times

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Delay asymptotics and bounds for multitask parallel jobs

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Understanding the Efficiency of Multi-Server Service Systems

Open problems in queueing theory inspired by datacenter computing (cites work)
cites work: Q3720271

Open problems in queueing theory inspired by datacenter computing (DOI)
DOI: 10.1007/S11134-020-09684-6