An Analysis of a Memory Allocation Scheme for Implementing Stacks

DOI10.1137/0210029MaRDI QIDQ3907054zbMATH OpenOpenAlexFDO

Authors Andrew Chi-Chih Yao

Publication date 1981

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/91a1abecafed6ce488894f5deb69325f04c7cf6f

zbMATH Keywords

deletioninsertionmemory allocationmemory utilizationstack

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25)

Cited in

(15)

• Optimal computer memory allocation for the Poisson flows
• Random walks, heat equation and distributed algorithms
• Basic analytic combinatorics of directed lattice paths
• About optimal management of work-stealing deques in two-level memory
• Approximation of the exit probability of a stable Markov modulated constrained random walk
• Excessive backlog probabilities of two parallel queues
• The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
• About optimal management of FIFO-queues in two-level memory
• Analysis of distributed systems via quasi-stationary distributions
• Colliding stacks: A large deviations analysis
• Approximation of excessive backlog probabilities of two tandem queues
• The exhaustion of shared memory: Stochastic results
• Optimal management of two parallel stacks in two-level memory
• Hitting probabilities of constrained random walks representing tandem networks
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment

This page was built for publication: An Analysis of a Memory Allocation Scheme for Implementing Stacks

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