First-fit allocation of queues: Tight probabilistic bounds on wasted space

DOI10.1016/0304-4149(90)90098-DzbMATH Open0722.60094OpenAlexW2000320900MaRDI QIDQ756295FDOQ756295

Authors: L. Flatto, E. G. jun. Coffman, F. Thomson Leighton 

Publication date: 1990

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(90)90098-d

Recommendations

• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• Some exact and asymptotic solutions to single server models of dynamic storage
• scientific article; zbMATH DE number 3862198
• Stochastic Models of Queue Storage
• Storage allocation under processor sharing. II: Further asymptotic results

zbMATH Keywords

random walkPoisson processqueuesprocessor sharingfirst-in-first-outsteady state in heavy traffic

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Sums of independent random variables; random walks (60G50)

Cites Work

• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Markov chain models - rarity and exponentiality
• Title not available (Why is that?)
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A provably efficient algorithm for dynamic storage allocation
• Sunset over Brownistan
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Stochastic Models of Queue Storage
• Title not available (Why is that?)
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl

Cited In (9)

• Storage allocation under processor sharing. I: Exact solutions and asymptotics
• Some exact and asymptotic solutions to single server models of dynamic storage
• Storage allocation under processor sharing. II: Further asymptotic results
• Asymptotic expansions for a stochastic model of queue storage
• Optimal queue to minimize waste
• Average-case analysis of cutting and packing in two dimensions
• Geometrical Optics and Models of Computer Memory Fragmentation
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• Packings in two dimensions: Asymptotic average-case analysis of algorithms

This page was built for publication: First-fit allocation of queues: Tight probabilistic bounds on wasted space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756295)