An Analysis of a Memory Allocation Scheme for Implementing Stacks

DOI10.1137/0210029zbMath0457.68023OpenAlexW2005317775MaRDI QIDQ3907054

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

memory allocationdeletioninsertionstackmemory utilization

Mathematics Subject Classification ID

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

Related Items (14)

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

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