A provably efficient algorithm for dynamic storage allocation
type: Item
instance of: scholarly article
title: A provably efficient algorithm for dynamic storage allocation
zbMATH Open document ID: 0723.60117
DOI: 10.1016/0022-0000(89)90031-7
published in: Journal of Computer and System Sciences
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 60K30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4192849
zbMATH Keywords: design and analysis of algorithms for on-line dynamic storage allocation
zbMATH Keywords: Poisson process
zbMATH Keywords: bin-packing
zbMATH Keywords: planar matching
zbMATH Keywords: experimental data
author: E. G. jun. Coffman
author: F. Thomson Leighton
MaRDI profile type: Publication
full work available at URL: 0022-0000(89)90031-7
OpenAlex ID: W4230764056
cites work: Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
cites work: Algorithms for resolving conflicts in dynamic storage allocation
cites work: Q3783352
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: An Introduction to Combinatorial Models of Dynamic Storage Allocation
cites work: A Stochastic Model of Fragmentation in Dynamic Storage Allocation
cites work: Q5544740
cites work: Q5538132
cites work: Q5674160
cites work: Limiting diffusion approximations for the many server queue and the repairman problem
cites work: Weak convergence of compound stochastic process. I
cites work: Q5765718
cites work: Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
cites work: The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
cites work: The average-case analysis of some on-line algorithms for bin packing
cites work: On the external storage fragmentation produced by first-fit and best-fit allocation strategies
description: scientific article; zbMATH DE number 4192849