Random walks, heat equation and distributed algorithms

DOI10.1016/0377-0427(94)90048-5zbMath0820.68052OpenAlexW2041837848MaRDI QIDQ1344290

V. Pereyra

Publication date: 11 September 1995

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(94)90048-5

zbMATH Keywords

random walkdistributed algorithmsBanker's algorithmstorage allocation algorithm

Mathematics Subject Classification ID

Applications to the sciences (65Z05) Theory of operating systems (68N25) Distributed algorithms (68W15)

Related Items (10)

Large deviations analysis for distributed algorithms in an ergodic Markovian environment ⋮ 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 ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ Optimal management of two parallel stacks in two-level memory ⋮ Hitting time of a corner for a reflected diffusion in the square ⋮ About optimal management of work-stealing deques in two-level memory ⋮ Analysis of distributed systems via quasi-stationary distributions

Uses Software

• Unnamed Item

Cites Work

• An accurate algorithm for computing the eigenvalues of a polygonal membrane
• Automatic average-case analysis of algorithms
• Probabilistic analysis of some distributed algorithms
• Singularity Analysis of Generating Functions
• An Analysis of a Memory Allocation Scheme for Implementing Stacks
• Colliding stacks: A large deviations analysis
• On the Altitude of Nodes in Random Trees
• Approximations and Bounds for Eigenvalues of Elliptic Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random walks, heat equation and distributed algorithms