The exhaustion of shared memory: Stochastic results

DOI10.1007/3-540-57155-8_274zbMath1504.68018OpenAlexW1532391948MaRDI QIDQ5060140

No author found.

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_274

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Data structures (68P05) Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Random trees in queueing systems with deadlines ⋮ Analysis of distributed systems via quasi-stationary distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic models of computer deadlock
• Probabilistic analysis of some distributed algorithms
• A Direct Approach to the Exit Problem
• An Asymptotic Theory of Large Deviations for Markov Jump Processes
• An Analysis of a Memory Allocation Scheme for Implementing Stacks
• The Maximum Size of Dynamic Data Structures
• Colliding stacks: A large deviations analysis
• Statistical Properties of the Buddy System

This page was built for publication: The exhaustion of shared memory: Stochastic results